./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6d41d2a2a28e240d9196f063199b00c22e981e9 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 03:34:52,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 03:34:52,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 03:34:52,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 03:34:52,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 03:34:52,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 03:34:52,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 03:34:52,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 03:34:52,227 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 03:34:52,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 03:34:52,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 03:34:52,235 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 03:34:52,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 03:34:52,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 03:34:52,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 03:34:52,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 03:34:52,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 03:34:52,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 03:34:52,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 03:34:52,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 03:34:52,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 03:34:52,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 03:34:52,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 03:34:52,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 03:34:52,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 03:34:52,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 03:34:52,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 03:34:52,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 03:34:52,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 03:34:52,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 03:34:52,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 03:34:52,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 03:34:52,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 03:34:52,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 03:34:52,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 03:34:52,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 03:34:52,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 03:34:52,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 03:34:52,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 03:34:52,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 03:34:52,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 03:34:52,272 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 03:34:52,307 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 03:34:52,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 03:34:52,308 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 03:34:52,308 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 03:34:52,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 03:34:52,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 03:34:52,310 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 03:34:52,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 03:34:52,311 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 03:34:52,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 03:34:52,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 03:34:52,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 03:34:52,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 03:34:52,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 03:34:52,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 03:34:52,313 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 03:34:52,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 03:34:52,314 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 03:34:52,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 03:34:52,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 03:34:52,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 03:34:52,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 03:34:52,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:34:52,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 03:34:52,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 03:34:52,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 03:34:52,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 03:34:52,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 03:34:52,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 03:34:52,316 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 03:34:52,316 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 -> c6d41d2a2a28e240d9196f063199b00c22e981e9 [2021-08-26 03:34:52,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 03:34:52,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 03:34:52,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 03:34:52,655 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 03:34:52,656 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 03:34:52,657 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-08-26 03:34:52,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9481ac6ab/2ccd5265763a4f2fb110f5da339d1025/FLAGe4480f3c5 [2021-08-26 03:34:53,114 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 03:34:53,117 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-08-26 03:34:53,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9481ac6ab/2ccd5265763a4f2fb110f5da339d1025/FLAGe4480f3c5 [2021-08-26 03:34:53,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9481ac6ab/2ccd5265763a4f2fb110f5da339d1025 [2021-08-26 03:34:53,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 03:34:53,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 03:34:53,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 03:34:53,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 03:34:53,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 03:34:53,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:34:53" (1/1) ... [2021-08-26 03:34:53,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f4bc9d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:53, skipping insertion in model container [2021-08-26 03:34:53,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:34:53" (1/1) ... [2021-08-26 03:34:53,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 03:34:53,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 03:34:53,707 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-08-26 03:34:53,715 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-08-26 03:34:53,720 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-08-26 03:34:53,726 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-08-26 03:34:53,729 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-08-26 03:34:53,732 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-08-26 03:34:53,736 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-08-26 03:34:53,737 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-08-26 03:34:53,738 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-08-26 03:34:53,739 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-08-26 03:34:53,744 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-08-26 03:34:53,746 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-08-26 03:34:53,748 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-08-26 03:34:53,751 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-08-26 03:34:53,754 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-08-26 03:34:53,755 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-08-26 03:34:53,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:34:53,772 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 03:34:53,828 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-08-26 03:34:53,829 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-08-26 03:34:53,830 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-08-26 03:34:53,831 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-08-26 03:34:53,833 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-08-26 03:34:53,834 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-08-26 03:34:53,835 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-08-26 03:34:53,836 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-08-26 03:34:53,837 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-08-26 03:34:53,838 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-08-26 03:34:53,839 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-08-26 03:34:53,840 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-08-26 03:34:53,841 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-08-26 03:34:53,842 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-08-26 03:34:53,843 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-08-26 03:34:53,844 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-08-26 03:34:53,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:34:53,856 INFO L208 MainTranslator]: Completed translation [2021-08-26 03:34:53,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:53 WrapperNode [2021-08-26 03:34:53,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 03:34:53,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 03:34:53,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 03:34:53,858 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 03:34:53,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:53" (1/1) ... [2021-08-26 03:34:53,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:53" (1/1) ... [2021-08-26 03:34:53,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 03:34:53,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 03:34:53,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 03:34:53,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 03:34:53,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:53" (1/1) ... [2021-08-26 03:34:53,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:53" (1/1) ... [2021-08-26 03:34:53,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:53" (1/1) ... [2021-08-26 03:34:53,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:53" (1/1) ... [2021-08-26 03:34:53,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:53" (1/1) ... [2021-08-26 03:34:53,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:53" (1/1) ... [2021-08-26 03:34:53,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:53" (1/1) ... [2021-08-26 03:34:53,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 03:34:53,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 03:34:53,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 03:34:53,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 03:34:53,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:53" (1/1) ... [2021-08-26 03:34:53,954 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:34:53,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:34:53,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 03:34:54,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 03:34:54,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 03:34:54,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 03:34:54,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 03:34:54,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 03:34:54,353 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 03:34:54,353 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-26 03:34:54,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:34:54 BoogieIcfgContainer [2021-08-26 03:34:54,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 03:34:54,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 03:34:54,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 03:34:54,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 03:34:54,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:34:53" (1/3) ... [2021-08-26 03:34:54,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae0b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:34:54, skipping insertion in model container [2021-08-26 03:34:54,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:53" (2/3) ... [2021-08-26 03:34:54,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae0b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:34:54, skipping insertion in model container [2021-08-26 03:34:54,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:34:54" (3/3) ... [2021-08-26 03:34:54,361 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2021-08-26 03:34:54,365 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 03:34:54,365 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2021-08-26 03:34:54,438 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 03:34:54,443 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 03:34:54,443 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-08-26 03:34:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 59 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-26 03:34:54,475 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:54,476 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:54,477 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-26 03:34:54,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:54,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1241029004, now seen corresponding path program 1 times [2021-08-26 03:34:54,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:54,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406864516] [2021-08-26 03:34:54,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:54,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:54,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:54,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406864516] [2021-08-26 03:34:54,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406864516] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:54,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:54,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 03:34:54,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074815338] [2021-08-26 03:34:54,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 03:34:54,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:54,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 03:34:54,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:34:54,719 INFO L87 Difference]: Start difference. First operand has 60 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 59 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:54,758 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2021-08-26 03:34:54,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 03:34:54,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-08-26 03:34:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:54,766 INFO L225 Difference]: With dead ends: 83 [2021-08-26 03:34:54,766 INFO L226 Difference]: Without dead ends: 72 [2021-08-26 03:34:54,769 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:34:54,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-08-26 03:34:54,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2021-08-26 03:34:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.475) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2021-08-26 03:34:54,803 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 9 [2021-08-26 03:34:54,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:54,803 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-08-26 03:34:54,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2021-08-26 03:34:54,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 03:34:54,805 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:54,805 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:54,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 03:34:54,805 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-26 03:34:54,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:54,809 INFO L82 PathProgramCache]: Analyzing trace with hash -182802478, now seen corresponding path program 1 times [2021-08-26 03:34:54,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:54,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737759740] [2021-08-26 03:34:54,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:54,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:54,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:54,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737759740] [2021-08-26 03:34:54,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737759740] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:54,885 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:54,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:34:54,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898547720] [2021-08-26 03:34:54,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:34:54,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:54,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:34:54,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:34:54,887 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:54,989 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2021-08-26 03:34:54,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:34:54,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-08-26 03:34:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:54,992 INFO L225 Difference]: With dead ends: 73 [2021-08-26 03:34:54,992 INFO L226 Difference]: Without dead ends: 71 [2021-08-26 03:34:54,993 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:34:54,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-08-26 03:34:54,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2021-08-26 03:34:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2021-08-26 03:34:55,003 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2021-08-26 03:34:55,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:55,004 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2021-08-26 03:34:55,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2021-08-26 03:34:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 03:34:55,005 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:55,005 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:55,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 03:34:55,006 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-26 03:34:55,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:55,007 INFO L82 PathProgramCache]: Analyzing trace with hash -179156060, now seen corresponding path program 1 times [2021-08-26 03:34:55,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:55,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988606948] [2021-08-26 03:34:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:55,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:55,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:55,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988606948] [2021-08-26 03:34:55,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988606948] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:55,105 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:55,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:34:55,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064864466] [2021-08-26 03:34:55,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:34:55,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:55,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:34:55,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:34:55,109 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:55,202 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2021-08-26 03:34:55,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:34:55,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-08-26 03:34:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:55,204 INFO L225 Difference]: With dead ends: 143 [2021-08-26 03:34:55,204 INFO L226 Difference]: Without dead ends: 93 [2021-08-26 03:34:55,204 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:34:55,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-08-26 03:34:55,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2021-08-26 03:34:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.435897435897436) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-08-26 03:34:55,211 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2021-08-26 03:34:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:55,211 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-08-26 03:34:55,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-08-26 03:34:55,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 03:34:55,212 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:55,212 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:55,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 03:34:55,213 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-26 03:34:55,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:55,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1258866483, now seen corresponding path program 1 times [2021-08-26 03:34:55,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:55,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949700569] [2021-08-26 03:34:55,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:55,214 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:55,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:55,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949700569] [2021-08-26 03:34:55,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949700569] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:55,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:55,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:34:55,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883638741] [2021-08-26 03:34:55,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:34:55,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:55,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:34:55,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:34:55,274 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:55,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:55,395 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2021-08-26 03:34:55,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:34:55,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 03:34:55,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:55,398 INFO L225 Difference]: With dead ends: 92 [2021-08-26 03:34:55,398 INFO L226 Difference]: Without dead ends: 90 [2021-08-26 03:34:55,398 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:34:55,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-08-26 03:34:55,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 50. [2021-08-26 03:34:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 49 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) [2021-08-26 03:34:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-08-26 03:34:55,413 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2021-08-26 03:34:55,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:55,414 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-08-26 03:34:55,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:55,414 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-08-26 03:34:55,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 03:34:55,414 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:55,414 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:55,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 03:34:55,414 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-26 03:34:55,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:55,415 INFO L82 PathProgramCache]: Analyzing trace with hash 420636790, now seen corresponding path program 1 times [2021-08-26 03:34:55,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:55,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743865818] [2021-08-26 03:34:55,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:55,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:55,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:55,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743865818] [2021-08-26 03:34:55,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743865818] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:55,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:55,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:34:55,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042537638] [2021-08-26 03:34:55,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:34:55,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:55,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:34:55,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:34:55,471 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:55,572 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2021-08-26 03:34:55,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:34:55,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 03:34:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:55,575 INFO L225 Difference]: With dead ends: 69 [2021-08-26 03:34:55,576 INFO L226 Difference]: Without dead ends: 67 [2021-08-26 03:34:55,579 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:34:55,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-08-26 03:34:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2021-08-26 03:34:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 47 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) [2021-08-26 03:34:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2021-08-26 03:34:55,592 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2021-08-26 03:34:55,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:55,592 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-08-26 03:34:55,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:55,593 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2021-08-26 03:34:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 03:34:55,593 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:55,593 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:55,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 03:34:55,593 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-26 03:34:55,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:55,594 INFO L82 PathProgramCache]: Analyzing trace with hash -370151221, now seen corresponding path program 1 times [2021-08-26 03:34:55,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:55,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924954726] [2021-08-26 03:34:55,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:55,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:55,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:55,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924954726] [2021-08-26 03:34:55,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924954726] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:55,654 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:55,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:34:55,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205798968] [2021-08-26 03:34:55,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:34:55,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:55,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:34:55,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:34:55,655 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:55,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:55,771 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2021-08-26 03:34:55,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:34:55,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 03:34:55,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:55,772 INFO L225 Difference]: With dead ends: 87 [2021-08-26 03:34:55,772 INFO L226 Difference]: Without dead ends: 85 [2021-08-26 03:34:55,773 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 52.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:34:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-08-26 03:34:55,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2021-08-26 03:34:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 45 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) [2021-08-26 03:34:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-08-26 03:34:55,776 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 12 [2021-08-26 03:34:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:55,777 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-08-26 03:34:55,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-08-26 03:34:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 03:34:55,777 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:55,777 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:55,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 03:34:55,778 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-26 03:34:55,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:55,778 INFO L82 PathProgramCache]: Analyzing trace with hash 154842714, now seen corresponding path program 1 times [2021-08-26 03:34:55,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:55,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630602664] [2021-08-26 03:34:55,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:55,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:55,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:55,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:55,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630602664] [2021-08-26 03:34:55,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630602664] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:55,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:55,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:34:55,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787480525] [2021-08-26 03:34:55,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:34:55,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:55,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:34:55,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:34:55,868 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:56,031 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2021-08-26 03:34:56,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:34:56,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 03:34:56,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:56,033 INFO L225 Difference]: With dead ends: 75 [2021-08-26 03:34:56,033 INFO L226 Difference]: Without dead ends: 73 [2021-08-26 03:34:56,034 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 79.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:34:56,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-08-26 03:34:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2021-08-26 03:34:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2021-08-26 03:34:56,040 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 13 [2021-08-26 03:34:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:56,040 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2021-08-26 03:34:56,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2021-08-26 03:34:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 03:34:56,041 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:56,041 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:56,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 03:34:56,042 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-26 03:34:56,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:56,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1410218132, now seen corresponding path program 1 times [2021-08-26 03:34:56,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:56,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406752676] [2021-08-26 03:34:56,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:56,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:56,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:56,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406752676] [2021-08-26 03:34:56,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406752676] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:56,119 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:56,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:34:56,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878807321] [2021-08-26 03:34:56,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:34:56,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:56,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:34:56,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:34:56,129 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:56,203 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2021-08-26 03:34:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:34:56,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 03:34:56,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:56,205 INFO L225 Difference]: With dead ends: 83 [2021-08-26 03:34:56,205 INFO L226 Difference]: Without dead ends: 81 [2021-08-26 03:34:56,207 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:34:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-08-26 03:34:56,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 42. [2021-08-26 03:34:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-08-26 03:34:56,220 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2021-08-26 03:34:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:56,222 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-08-26 03:34:56,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-08-26 03:34:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 03:34:56,223 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:56,223 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:56,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 03:34:56,224 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-26 03:34:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:56,229 INFO L82 PathProgramCache]: Analyzing trace with hash 505160957, now seen corresponding path program 1 times [2021-08-26 03:34:56,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:56,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197407418] [2021-08-26 03:34:56,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:56,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:56,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:56,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197407418] [2021-08-26 03:34:56,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197407418] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:56,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:56,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:34:56,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971661324] [2021-08-26 03:34:56,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:34:56,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:56,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:34:56,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:34:56,292 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:56,391 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2021-08-26 03:34:56,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:34:56,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 03:34:56,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:56,392 INFO L225 Difference]: With dead ends: 57 [2021-08-26 03:34:56,392 INFO L226 Difference]: Without dead ends: 55 [2021-08-26 03:34:56,392 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 43.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:34:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-08-26 03:34:56,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2021-08-26 03:34:56,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-08-26 03:34:56,395 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2021-08-26 03:34:56,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:56,395 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-08-26 03:34:56,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,395 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-08-26 03:34:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 03:34:56,396 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:56,396 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:56,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 03:34:56,396 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-26 03:34:56,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:56,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1519875391, now seen corresponding path program 1 times [2021-08-26 03:34:56,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:56,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496030504] [2021-08-26 03:34:56,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:56,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:56,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:56,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496030504] [2021-08-26 03:34:56,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496030504] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:56,436 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:56,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:34:56,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146417096] [2021-08-26 03:34:56,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:34:56,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:56,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:34:56,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:34:56,437 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:56,494 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2021-08-26 03:34:56,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:34:56,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-26 03:34:56,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:56,495 INFO L225 Difference]: With dead ends: 57 [2021-08-26 03:34:56,495 INFO L226 Difference]: Without dead ends: 55 [2021-08-26 03:34:56,495 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:34:56,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-08-26 03:34:56,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2021-08-26 03:34:56,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-08-26 03:34:56,498 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2021-08-26 03:34:56,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:56,498 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-08-26 03:34:56,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-08-26 03:34:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 03:34:56,499 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:56,499 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:56,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 03:34:56,499 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-26 03:34:56,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:56,500 INFO L82 PathProgramCache]: Analyzing trace with hash 128507268, now seen corresponding path program 1 times [2021-08-26 03:34:56,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:56,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207527264] [2021-08-26 03:34:56,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:56,500 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:56,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:56,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207527264] [2021-08-26 03:34:56,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207527264] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:56,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:56,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:34:56,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352384060] [2021-08-26 03:34:56,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:34:56,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:56,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:34:56,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:34:56,543 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:56,622 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2021-08-26 03:34:56,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:34:56,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-26 03:34:56,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:56,623 INFO L225 Difference]: With dead ends: 65 [2021-08-26 03:34:56,623 INFO L226 Difference]: Without dead ends: 63 [2021-08-26 03:34:56,623 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:34:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-08-26 03:34:56,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2021-08-26 03:34:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2021-08-26 03:34:56,626 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2021-08-26 03:34:56,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:56,626 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-08-26 03:34:56,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2021-08-26 03:34:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 03:34:56,626 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:56,626 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:56,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 03:34:56,627 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-26 03:34:56,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:56,627 INFO L82 PathProgramCache]: Analyzing trace with hash -311237848, now seen corresponding path program 1 times [2021-08-26 03:34:56,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:56,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291910455] [2021-08-26 03:34:56,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:56,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:56,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:56,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291910455] [2021-08-26 03:34:56,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291910455] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:56,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:56,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:34:56,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726297428] [2021-08-26 03:34:56,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:34:56,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:56,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:34:56,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:34:56,678 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:56,813 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2021-08-26 03:34:56,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:34:56,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 03:34:56,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:56,814 INFO L225 Difference]: With dead ends: 70 [2021-08-26 03:34:56,814 INFO L226 Difference]: Without dead ends: 68 [2021-08-26 03:34:56,814 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:34:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-08-26 03:34:56,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 34. [2021-08-26 03:34:56,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-08-26 03:34:56,823 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2021-08-26 03:34:56,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:56,824 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-08-26 03:34:56,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:56,824 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-08-26 03:34:56,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 03:34:56,827 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:56,827 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:56,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 03:34:56,828 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-26 03:34:56,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:56,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1058434549, now seen corresponding path program 1 times [2021-08-26 03:34:56,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:56,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359229148] [2021-08-26 03:34:56,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:56,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:56,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:56,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359229148] [2021-08-26 03:34:56,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359229148] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:56,912 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:56,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:34:56,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277168182] [2021-08-26 03:34:56,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:34:56,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:56,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:34:56,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:34:56,914 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:57,081 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2021-08-26 03:34:57,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 03:34:57,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-26 03:34:57,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:57,082 INFO L225 Difference]: With dead ends: 58 [2021-08-26 03:34:57,082 INFO L226 Difference]: Without dead ends: 56 [2021-08-26 03:34:57,082 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 88.3ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-08-26 03:34:57,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-08-26 03:34:57,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2021-08-26 03:34:57,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-08-26 03:34:57,097 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2021-08-26 03:34:57,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:57,097 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-08-26 03:34:57,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-08-26 03:34:57,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 03:34:57,098 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:57,098 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:57,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 03:34:57,098 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-26 03:34:57,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:57,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1548271503, now seen corresponding path program 1 times [2021-08-26 03:34:57,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:57,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014734717] [2021-08-26 03:34:57,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:57,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:57,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:57,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:57,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014734717] [2021-08-26 03:34:57,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014734717] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:57,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:57,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:34:57,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824715678] [2021-08-26 03:34:57,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:34:57,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:57,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:34:57,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:34:57,169 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:57,323 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2021-08-26 03:34:57,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:34:57,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-26 03:34:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:57,324 INFO L225 Difference]: With dead ends: 83 [2021-08-26 03:34:57,324 INFO L226 Difference]: Without dead ends: 81 [2021-08-26 03:34:57,325 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 32.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:34:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-08-26 03:34:57,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 30. [2021-08-26 03:34:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-08-26 03:34:57,329 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2021-08-26 03:34:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:57,329 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-08-26 03:34:57,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-08-26 03:34:57,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-26 03:34:57,332 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:57,332 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:57,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 03:34:57,332 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-26 03:34:57,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:57,333 INFO L82 PathProgramCache]: Analyzing trace with hash 751780498, now seen corresponding path program 1 times [2021-08-26 03:34:57,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:57,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570547007] [2021-08-26 03:34:57,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:57,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:57,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:57,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570547007] [2021-08-26 03:34:57,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570547007] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:57,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:57,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:34:57,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138750718] [2021-08-26 03:34:57,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:34:57,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:57,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:34:57,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:34:57,416 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:57,559 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2021-08-26 03:34:57,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 03:34:57,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-08-26 03:34:57,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:57,560 INFO L225 Difference]: With dead ends: 56 [2021-08-26 03:34:57,560 INFO L226 Difference]: Without dead ends: 54 [2021-08-26 03:34:57,560 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 87.3ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-08-26 03:34:57,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-08-26 03:34:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 28. [2021-08-26 03:34:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-08-26 03:34:57,564 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2021-08-26 03:34:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:57,564 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-08-26 03:34:57,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-08-26 03:34:57,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 03:34:57,564 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:57,564 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:57,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 03:34:57,565 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-26 03:34:57,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:57,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1830363126, now seen corresponding path program 1 times [2021-08-26 03:34:57,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:57,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737416825] [2021-08-26 03:34:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:57,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:57,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:57,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737416825] [2021-08-26 03:34:57,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737416825] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:57,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:57,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:34:57,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781939878] [2021-08-26 03:34:57,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:34:57,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:57,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:34:57,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:34:57,627 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:57,855 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2021-08-26 03:34:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 03:34:57,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-08-26 03:34:57,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:57,856 INFO L225 Difference]: With dead ends: 121 [2021-08-26 03:34:57,857 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 03:34:57,858 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 54.2ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-26 03:34:57,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 03:34:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 03:34:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 03:34:57,859 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2021-08-26 03:34:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:57,859 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 03:34:57,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:57,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 03:34:57,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 03:34:57,863 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:57,863 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:57,863 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:57,863 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:57,864 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:57,864 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:57,864 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:57,864 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:57,864 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:57,865 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:57,865 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:57,865 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:57,865 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:57,865 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:57,865 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:57,865 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:57,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 03:34:57,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 03:34:57,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:34:57,988 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:34:58,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:34:58,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:34:58,821 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-08-26 03:34:58,821 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2021-08-26 03:34:58,822 INFO L857 garLoopResultBuilder]: For program point L217(line 217) no Hoare annotation was computed. [2021-08-26 03:34:58,822 INFO L857 garLoopResultBuilder]: For program point L151(lines 151 281) no Hoare annotation was computed. [2021-08-26 03:34:58,822 INFO L857 garLoopResultBuilder]: For program point L110(lines 110 123) no Hoare annotation was computed. [2021-08-26 03:34:58,822 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2021-08-26 03:34:58,822 INFO L857 garLoopResultBuilder]: For program point L36(lines 36 300) no Hoare annotation was computed. [2021-08-26 03:34:58,822 INFO L857 garLoopResultBuilder]: For program point L193(line 193) no Hoare annotation was computed. [2021-08-26 03:34:58,822 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2021-08-26 03:34:58,822 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 03:34:58,822 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 03:34:58,822 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 127) no Hoare annotation was computed. [2021-08-26 03:34:58,822 INFO L857 garLoopResultBuilder]: For program point L20(lines 20 312) no Hoare annotation was computed. [2021-08-26 03:34:58,823 INFO L857 garLoopResultBuilder]: For program point L243(lines 243 267) no Hoare annotation was computed. [2021-08-26 03:34:58,823 INFO L857 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2021-08-26 03:34:58,823 INFO L857 garLoopResultBuilder]: For program point L45(lines 45 288) no Hoare annotation was computed. [2021-08-26 03:34:58,823 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2021-08-26 03:34:58,823 INFO L853 garLoopResultBuilder]: At program point L293(lines 38 294) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~main__j~0) (< ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__len~0) (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0) (<= (+ ULTIMATE.start_main_~main__j~0 5) ULTIMATE.start_main_~main__bufsize~0)) [2021-08-26 03:34:58,823 INFO L857 garLoopResultBuilder]: For program point L227(lines 227 269) no Hoare annotation was computed. [2021-08-26 03:34:58,823 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2021-08-26 03:34:58,823 INFO L857 garLoopResultBuilder]: For program point L153(line 153) no Hoare annotation was computed. [2021-08-26 03:34:58,823 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) no Hoare annotation was computed. [2021-08-26 03:34:58,824 INFO L860 garLoopResultBuilder]: At program point L310(lines 13 313) the Hoare annotation is: true [2021-08-26 03:34:58,824 INFO L857 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2021-08-26 03:34:58,825 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 245) no Hoare annotation was computed. [2021-08-26 03:34:58,825 INFO L857 garLoopResultBuilder]: For program point L203(lines 203 273) no Hoare annotation was computed. [2021-08-26 03:34:58,825 INFO L857 garLoopResultBuilder]: For program point L38(lines 38 294) no Hoare annotation was computed. [2021-08-26 03:34:58,825 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 141) no Hoare annotation was computed. [2021-08-26 03:34:58,825 INFO L857 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2021-08-26 03:34:58,825 INFO L857 garLoopResultBuilder]: For program point L245(line 245) no Hoare annotation was computed. [2021-08-26 03:34:58,825 INFO L857 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2021-08-26 03:34:58,825 INFO L857 garLoopResultBuilder]: For program point L229(line 229) no Hoare annotation was computed. [2021-08-26 03:34:58,825 INFO L857 garLoopResultBuilder]: For program point L163(lines 163 279) no Hoare annotation was computed. [2021-08-26 03:34:58,825 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2021-08-26 03:34:58,826 INFO L853 garLoopResultBuilder]: At program point L304(lines 25 312) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0) (or (<= 1 ULTIMATE.start_main_~main__i~0) (= ULTIMATE.start_main_~main__i~0 0))) [2021-08-26 03:34:58,826 INFO L857 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2021-08-26 03:34:58,826 INFO L857 garLoopResultBuilder]: For program point L139(lines 139 283) no Hoare annotation was computed. [2021-08-26 03:34:58,826 INFO L857 garLoopResultBuilder]: For program point L98(lines 98 125) no Hoare annotation was computed. [2021-08-26 03:34:58,827 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 03:34:58,827 INFO L857 garLoopResultBuilder]: For program point L255(lines 255 265) no Hoare annotation was computed. [2021-08-26 03:34:58,827 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 165) no Hoare annotation was computed. [2021-08-26 03:34:58,827 INFO L857 garLoopResultBuilder]: For program point L57(lines 57 286) no Hoare annotation was computed. [2021-08-26 03:34:58,827 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2021-08-26 03:34:58,827 INFO L857 garLoopResultBuilder]: For program point L74(lines 74 129) no Hoare annotation was computed. [2021-08-26 03:34:58,827 INFO L853 garLoopResultBuilder]: At program point L264(lines 31 306) the Hoare annotation is: (let ((.cse0 (<= (+ ULTIMATE.start_main_~main__j~0 4) ULTIMATE.start_main_~main__bufsize~0)) (.cse3 (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0))) (let ((.cse1 (<= 1 ULTIMATE.start_main_~main__j~0)) (.cse2 (let ((.cse4 (<= 0 ULTIMATE.start_main_~main__j~0)) (.cse5 (<= 1 ULTIMATE.start_main_~main__i~0))) (or (and .cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse3 .cse5) (and .cse0 .cse4 .cse3 .cse5))))) (or (and .cse0 .cse1 .cse2) (and .cse1 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~14 0)) .cse2) (and (< ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__len~0) (<= 0 ULTIMATE.start_main_~main__i~0) .cse3 (= ULTIMATE.start_main_~main__j~0 0))))) [2021-08-26 03:34:58,827 INFO L857 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2021-08-26 03:34:58,827 INFO L857 garLoopResultBuilder]: For program point L66(lines 66 285) no Hoare annotation was computed. [2021-08-26 03:34:58,828 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 03:34:58,828 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 153) no Hoare annotation was computed. [2021-08-26 03:34:58,828 INFO L857 garLoopResultBuilder]: For program point L215(lines 215 271) no Hoare annotation was computed. [2021-08-26 03:34:58,828 INFO L857 garLoopResultBuilder]: For program point L141(line 141) no Hoare annotation was computed. [2021-08-26 03:34:58,828 INFO L857 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2021-08-26 03:34:58,828 INFO L857 garLoopResultBuilder]: For program point L257(line 257) no Hoare annotation was computed. [2021-08-26 03:34:58,828 INFO L857 garLoopResultBuilder]: For program point L191(lines 191 275) no Hoare annotation was computed. [2021-08-26 03:34:58,828 INFO L857 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2021-08-26 03:34:58,828 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 193) no Hoare annotation was computed. [2021-08-26 03:34:58,828 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2021-08-26 03:34:58,828 INFO L857 garLoopResultBuilder]: For program point L175(lines 175 277) no Hoare annotation was computed. [2021-08-26 03:34:58,829 INFO L857 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2021-08-26 03:34:58,829 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 229) no Hoare annotation was computed. [2021-08-26 03:34:58,832 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 03:34:58,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:34:58 BoogieIcfgContainer [2021-08-26 03:34:58,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 03:34:58,856 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 03:34:58,856 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 03:34:58,856 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 03:34:58,857 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:34:54" (3/4) ... [2021-08-26 03:34:58,859 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 03:34:58,870 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-26 03:34:58,870 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-26 03:34:58,871 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 03:34:58,871 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 03:34:58,925 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 03:34:58,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 03:34:58,926 INFO L168 Benchmark]: Toolchain (without parser) took 5397.91 ms. Allocated memory was 58.7 MB in the beginning and 104.9 MB in the end (delta: 46.1 MB). Free memory was 37.3 MB in the beginning and 52.2 MB in the end (delta: -14.9 MB). Peak memory consumption was 31.2 MB. Max. memory is 16.1 GB. [2021-08-26 03:34:58,927 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 58.7 MB. Free memory was 40.5 MB in the beginning and 40.5 MB in the end (delta: 42.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:34:58,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.90 ms. Allocated memory is still 58.7 MB. Free memory was 37.0 MB in the beginning and 39.3 MB in the end (delta: -2.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-08-26 03:34:58,928 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.24 ms. Allocated memory is still 58.7 MB. Free memory was 39.2 MB in the beginning and 37.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 03:34:58,928 INFO L168 Benchmark]: Boogie Preprocessor took 41.50 ms. Allocated memory is still 58.7 MB. Free memory was 37.2 MB in the beginning and 36.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 03:34:58,928 INFO L168 Benchmark]: RCFGBuilder took 407.62 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 35.9 MB in the beginning and 43.7 MB in the end (delta: -7.7 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. [2021-08-26 03:34:58,929 INFO L168 Benchmark]: TraceAbstraction took 4499.38 ms. Allocated memory was 71.3 MB in the beginning and 104.9 MB in the end (delta: 33.6 MB). Free memory was 43.3 MB in the beginning and 57.4 MB in the end (delta: -14.1 MB). Peak memory consumption was 41.0 MB. Max. memory is 16.1 GB. [2021-08-26 03:34:58,929 INFO L168 Benchmark]: Witness Printer took 69.04 ms. Allocated memory is still 104.9 MB. Free memory was 57.4 MB in the beginning and 52.2 MB in the end (delta: 5.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-26 03:34:58,931 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.13 ms. Allocated memory is still 58.7 MB. Free memory was 40.5 MB in the beginning and 40.5 MB in the end (delta: 42.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 327.90 ms. Allocated memory is still 58.7 MB. Free memory was 37.0 MB in the beginning and 39.3 MB in the end (delta: -2.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.24 ms. Allocated memory is still 58.7 MB. Free memory was 39.2 MB in the beginning and 37.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.50 ms. Allocated memory is still 58.7 MB. Free memory was 37.2 MB in the beginning and 36.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 407.62 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 35.9 MB in the beginning and 43.7 MB in the end (delta: -7.7 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4499.38 ms. Allocated memory was 71.3 MB in the beginning and 104.9 MB in the end (delta: 33.6 MB). Free memory was 43.3 MB in the beginning and 57.4 MB in the end (delta: -14.1 MB). Peak memory consumption was 41.0 MB. Max. memory is 16.1 GB. * Witness Printer took 69.04 ms. Allocated memory is still 104.9 MB. Free memory was 57.4 MB in the beginning and 52.2 MB in the end (delta: 5.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 59]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 88]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 100]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 112]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 141]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 153]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 165]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 193]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 205]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 217]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 229]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 245]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 4395.4ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 16.9ms, AutomataDifference: 1951.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 955.0ms, InitialAbstractionConstructionTime: 25.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 883 SDtfs, 1267 SDslu, 709 SDs, 0 SdLazy, 900 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 954.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 616.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 125.0ms AutomataMinimizationTime, 16 MinimizatonAttempts, 436 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 25 NumberOfFragments, 135 HoareAnnotationTreeSize, 4 FomulaSimplifications, 233224006 FormulaSimplificationTreeSizeReduction, 323.0ms HoareSimplificationTime, 4 FomulaSimplificationsInter, 74415 FormulaSimplificationTreeSizeReductionInter, 624.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 33.7ms SsaConstructionTime, 168.0ms SatisfiabilityAnalysisTime, 876.8ms InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 638 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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: 38]: Loop Invariant Derived loop invariant: (((0 <= main__j && main__i < main__len) && 0 <= main__i) && main__limit + 4 <= main__bufsize) && main__j + 5 <= main__bufsize - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((main__j + 4 <= main__bufsize && 1 <= main__j) && ((((0 <= main__j && !(__VERIFIER_assert__cond == 0)) && main__limit + 4 <= main__bufsize) && 1 <= main__i) || (((main__j + 4 <= main__bufsize && 0 <= main__j) && main__limit + 4 <= main__bufsize) && 1 <= main__i))) || ((1 <= main__j && !(__VERIFIER_assert__cond == 0)) && ((((0 <= main__j && !(__VERIFIER_assert__cond == 0)) && main__limit + 4 <= main__bufsize) && 1 <= main__i) || (((main__j + 4 <= main__bufsize && 0 <= main__j) && main__limit + 4 <= main__bufsize) && 1 <= main__i)))) || (((main__i < main__len && 0 <= main__i) && main__limit + 4 <= main__bufsize) && main__j == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: main__limit + 4 <= main__bufsize && (1 <= main__i || main__i == 0) RESULT: Ultimate proved your program to be correct! [2021-08-26 03:34:58,974 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...