./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 e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be --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 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:22:44,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:22:44,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:22:44,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:22:44,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:22:44,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:22:44,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:22:44,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:22:44,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:22:44,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:22:44,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:22:44,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:22:44,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:22:44,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:22:44,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:22:44,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:22:44,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:22:44,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:22:44,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:22:44,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:22:44,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:22:44,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:22:44,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:22:44,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:22:44,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:22:44,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:22:44,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:22:44,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:22:44,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:22:44,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:22:44,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:22:44,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:22:44,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:22:44,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:22:44,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:22:44,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:22:44,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:22:44,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:22:44,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:22:44,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:22:44,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:22:44,285 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-21 19:22:44,309 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:22:44,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:22:44,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:22:44,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:22:44,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:22:44,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:22:44,312 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:22:44,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:22:44,313 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:22:44,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:22:44,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:22:44,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:22:44,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 19:22:44,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 19:22:44,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 19:22:44,314 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:22:44,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 19:22:44,314 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:22:44,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 19:22:44,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:22:44,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:22:44,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 19:22:44,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:22:44,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:22:44,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 19:22:44,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 19:22:44,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:22:44,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 19:22:44,317 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 19:22:44,317 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 19:22:44,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 19:22:44,318 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:22:44,318 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be 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 -> 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 [2021-10-21 19:22:44,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:22:44,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:22:44,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:22:44,621 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:22:44,622 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:22:44,623 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-10-21 19:22:44,703 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be/data/db5000cc7/acea5ee741cf41839bb4fda30890bad7/FLAG82c980c62 [2021-10-21 19:22:45,122 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:22:45,123 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-10-21 19:22:45,130 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be/data/db5000cc7/acea5ee741cf41839bb4fda30890bad7/FLAG82c980c62 [2021-10-21 19:22:45,511 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be/data/db5000cc7/acea5ee741cf41839bb4fda30890bad7 [2021-10-21 19:22:45,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:22:45,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 19:22:45,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:22:45,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:22:45,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:22:45,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:22:45" (1/1) ... [2021-10-21 19:22:45,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47a3d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:22:45, skipping insertion in model container [2021-10-21 19:22:45,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:22:45" (1/1) ... [2021-10-21 19:22:45,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:22:45,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:22:45,724 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-10-21 19:22:45,729 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-10-21 19:22:45,731 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-10-21 19:22:45,733 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-10-21 19:22:45,735 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-10-21 19:22:45,737 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-10-21 19:22:45,741 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-10-21 19:22:45,742 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-10-21 19:22:45,744 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-10-21 19:22:45,746 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-10-21 19:22:45,749 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-10-21 19:22:45,751 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-10-21 19:22:45,753 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-10-21 19:22:45,755 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-10-21 19:22:45,757 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-10-21 19:22:45,759 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-10-21 19:22:45,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:22:45,771 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:22:45,786 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-10-21 19:22:45,788 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-10-21 19:22:45,789 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-10-21 19:22:45,791 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-10-21 19:22:45,792 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-10-21 19:22:45,794 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-10-21 19:22:45,796 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-10-21 19:22:45,797 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-10-21 19:22:45,799 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-10-21 19:22:45,800 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-10-21 19:22:45,802 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-10-21 19:22:45,804 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-10-21 19:22:45,805 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-10-21 19:22:45,807 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-10-21 19:22:45,809 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-10-21 19:22:45,811 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-10-21 19:22:45,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:22:45,827 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:22:45,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:22:45 WrapperNode [2021-10-21 19:22:45,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:22:45,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 19:22:45,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 19:22:45,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 19:22:45,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:22:45" (1/1) ... [2021-10-21 19:22:45,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:22:45" (1/1) ... [2021-10-21 19:22:45,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 19:22:45,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:22:45,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:22:45,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:22:45,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:22:45" (1/1) ... [2021-10-21 19:22:45,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:22:45" (1/1) ... [2021-10-21 19:22:45,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:22:45" (1/1) ... [2021-10-21 19:22:45,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:22:45" (1/1) ... [2021-10-21 19:22:45,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:22:45" (1/1) ... [2021-10-21 19:22:45,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:22:45" (1/1) ... [2021-10-21 19:22:45,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:22:45" (1/1) ... [2021-10-21 19:22:45,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:22:45,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:22:45,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:22:45,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:22:45,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:22:45" (1/1) ... [2021-10-21 19:22:45,908 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:22:45,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:22:45,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 19:22:45,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 19:22:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 19:22:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:22:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:22:45,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:22:46,316 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:22:46,316 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-21 19:22:46,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:22:46 BoogieIcfgContainer [2021-10-21 19:22:46,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:22:46,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 19:22:46,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 19:22:46,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 19:22:46,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 07:22:45" (1/3) ... [2021-10-21 19:22:46,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1108bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:22:46, skipping insertion in model container [2021-10-21 19:22:46,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:22:45" (2/3) ... [2021-10-21 19:22:46,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1108bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:22:46, skipping insertion in model container [2021-10-21 19:22:46,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:22:46" (3/3) ... [2021-10-21 19:22:46,334 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2021-10-21 19:22:46,339 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 19:22:46,340 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2021-10-21 19:22:46,433 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 19:22:46,440 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-21 19:22:46,440 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-10-21 19:22:46,469 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-10-21 19:22:46,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-21 19:22:46,474 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:22:46,475 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:22:46,476 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-10-21 19:22:46,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:22:46,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1241029004, now seen corresponding path program 1 times [2021-10-21 19:22:46,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:22:46,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625100764] [2021-10-21 19:22:46,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:22:46,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:22:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:22:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:22:46,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:22:46,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625100764] [2021-10-21 19:22:46,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625100764] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:22:46,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:22:46,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:22:46,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803972899] [2021-10-21 19:22:46,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:22:46,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:22:46,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:22:46,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:22:46,829 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-10-21 19:22:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:22:46,858 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2021-10-21 19:22:46,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:22:46,860 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-10-21 19:22:46,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:22:46,869 INFO L225 Difference]: With dead ends: 83 [2021-10-21 19:22:46,869 INFO L226 Difference]: Without dead ends: 72 [2021-10-21 19:22:46,872 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:22:46,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-10-21 19:22:46,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2021-10-21 19:22:46,905 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-10-21 19:22:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2021-10-21 19:22:46,908 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 9 [2021-10-21 19:22:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:22:46,908 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-10-21 19:22:46,909 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-10-21 19:22:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2021-10-21 19:22:46,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-21 19:22:46,910 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:22:46,910 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:22:46,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 19:22:46,911 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-10-21 19:22:46,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:22:46,911 INFO L82 PathProgramCache]: Analyzing trace with hash -182802478, now seen corresponding path program 1 times [2021-10-21 19:22:46,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:22:46,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616152233] [2021-10-21 19:22:46,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:22:46,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:22:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:22:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:22:47,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:22:47,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616152233] [2021-10-21 19:22:47,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616152233] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:22:47,004 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:22:47,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:22:47,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643040654] [2021-10-21 19:22:47,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:22:47,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:22:47,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:22:47,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:22:47,012 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-10-21 19:22:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:22:47,097 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2021-10-21 19:22:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:22:47,100 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-10-21 19:22:47,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:22:47,101 INFO L225 Difference]: With dead ends: 73 [2021-10-21 19:22:47,102 INFO L226 Difference]: Without dead ends: 71 [2021-10-21 19:22:47,103 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:22:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-10-21 19:22:47,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2021-10-21 19:22:47,113 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-10-21 19:22:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2021-10-21 19:22:47,124 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2021-10-21 19:22:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:22:47,125 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2021-10-21 19:22:47,125 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-10-21 19:22:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2021-10-21 19:22:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-21 19:22:47,126 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:22:47,126 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:22:47,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 19:22:47,127 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-10-21 19:22:47,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:22:47,128 INFO L82 PathProgramCache]: Analyzing trace with hash -179156060, now seen corresponding path program 1 times [2021-10-21 19:22:47,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:22:47,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408755353] [2021-10-21 19:22:47,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:22:47,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:22:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:22:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:22:47,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:22:47,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408755353] [2021-10-21 19:22:47,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408755353] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:22:47,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:22:47,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:22:47,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049921247] [2021-10-21 19:22:47,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:22:47,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:22:47,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:22:47,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:22:47,242 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-10-21 19:22:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:22:47,336 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2021-10-21 19:22:47,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:22:47,337 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-10-21 19:22:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:22:47,338 INFO L225 Difference]: With dead ends: 143 [2021-10-21 19:22:47,338 INFO L226 Difference]: Without dead ends: 93 [2021-10-21 19:22:47,339 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:22:47,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-10-21 19:22:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2021-10-21 19:22:47,348 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-10-21 19:22:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-10-21 19:22:47,349 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2021-10-21 19:22:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:22:47,349 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-10-21 19:22:47,350 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-10-21 19:22:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-10-21 19:22:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-21 19:22:47,351 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:22:47,351 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:22:47,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 19:22:47,351 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-10-21 19:22:47,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:22:47,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1258866483, now seen corresponding path program 1 times [2021-10-21 19:22:47,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:22:47,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420605111] [2021-10-21 19:22:47,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:22:47,353 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:22:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:22:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:22:47,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:22:47,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420605111] [2021-10-21 19:22:47,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420605111] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:22:47,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:22:47,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:22:47,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797292819] [2021-10-21 19:22:47,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:22:47,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:22:47,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:22:47,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:22:47,409 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-10-21 19:22:47,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:22:47,467 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2021-10-21 19:22:47,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:22:47,467 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-10-21 19:22:47,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:22:47,473 INFO L225 Difference]: With dead ends: 92 [2021-10-21 19:22:47,473 INFO L226 Difference]: Without dead ends: 90 [2021-10-21 19:22:47,474 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:22:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-10-21 19:22:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 50. [2021-10-21 19:22:47,480 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-10-21 19:22:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-10-21 19:22:47,481 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2021-10-21 19:22:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:22:47,482 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-10-21 19:22:47,482 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-10-21 19:22:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-10-21 19:22:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-21 19:22:47,483 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:22:47,483 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:22:47,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 19:22:47,483 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-10-21 19:22:47,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:22:47,488 INFO L82 PathProgramCache]: Analyzing trace with hash 420636790, now seen corresponding path program 1 times [2021-10-21 19:22:47,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:22:47,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077331627] [2021-10-21 19:22:47,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:22:47,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:22:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:22:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:22:47,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:22:47,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077331627] [2021-10-21 19:22:47,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077331627] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:22:47,591 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:22:47,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:22:47,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869600773] [2021-10-21 19:22:47,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:22:47,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:22:47,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:22:47,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:22:47,593 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-10-21 19:22:47,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:22:47,697 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2021-10-21 19:22:47,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:22:47,698 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-10-21 19:22:47,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:22:47,699 INFO L225 Difference]: With dead ends: 69 [2021-10-21 19:22:47,701 INFO L226 Difference]: Without dead ends: 67 [2021-10-21 19:22:47,702 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:22:47,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-10-21 19:22:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2021-10-21 19:22:47,714 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-10-21 19:22:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2021-10-21 19:22:47,715 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2021-10-21 19:22:47,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:22:47,717 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-10-21 19:22:47,717 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-10-21 19:22:47,717 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2021-10-21 19:22:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-21 19:22:47,718 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:22:47,720 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:22:47,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 19:22:47,720 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-10-21 19:22:47,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:22:47,721 INFO L82 PathProgramCache]: Analyzing trace with hash -370151221, now seen corresponding path program 1 times [2021-10-21 19:22:47,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:22:47,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773600841] [2021-10-21 19:22:47,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:22:47,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:22:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:22:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:22:47,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:22:47,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773600841] [2021-10-21 19:22:47,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773600841] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:22:47,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:22:47,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:22:47,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718458794] [2021-10-21 19:22:47,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:22:47,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:22:47,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:22:47,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:22:47,789 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-10-21 19:22:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:22:47,915 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2021-10-21 19:22:47,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:22:47,920 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-10-21 19:22:47,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:22:47,921 INFO L225 Difference]: With dead ends: 87 [2021-10-21 19:22:47,921 INFO L226 Difference]: Without dead ends: 85 [2021-10-21 19:22:47,922 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 37.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:22:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-10-21 19:22:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2021-10-21 19:22:47,928 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-10-21 19:22:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-10-21 19:22:47,929 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 12 [2021-10-21 19:22:47,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:22:47,929 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-10-21 19:22:47,929 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-10-21 19:22:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-10-21 19:22:47,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-21 19:22:47,930 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:22:47,930 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:22:47,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 19:22:47,931 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-10-21 19:22:47,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:22:47,931 INFO L82 PathProgramCache]: Analyzing trace with hash 154842714, now seen corresponding path program 1 times [2021-10-21 19:22:47,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:22:47,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211769952] [2021-10-21 19:22:47,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:22:47,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:22:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:22:48,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:22:48,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:22:48,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211769952] [2021-10-21 19:22:48,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211769952] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:22:48,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:22:48,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:22:48,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520449524] [2021-10-21 19:22:48,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:22:48,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:22:48,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:22:48,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:22:48,036 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-10-21 19:22:48,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:22:48,150 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2021-10-21 19:22:48,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:22:48,151 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-10-21 19:22:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:22:48,152 INFO L225 Difference]: With dead ends: 75 [2021-10-21 19:22:48,152 INFO L226 Difference]: Without dead ends: 73 [2021-10-21 19:22:48,153 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:22:48,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-10-21 19:22:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2021-10-21 19:22:48,158 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-10-21 19:22:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2021-10-21 19:22:48,159 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 13 [2021-10-21 19:22:48,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:22:48,159 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2021-10-21 19:22:48,159 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-10-21 19:22:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2021-10-21 19:22:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-21 19:22:48,160 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:22:48,160 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:22:48,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 19:22:48,161 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-10-21 19:22:48,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:22:48,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1410218132, now seen corresponding path program 1 times [2021-10-21 19:22:48,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:22:48,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784882841] [2021-10-21 19:22:48,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:22:48,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:22:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:22:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:22:48,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:22:48,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784882841] [2021-10-21 19:22:48,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784882841] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:22:48,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:22:48,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:22:48,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660318968] [2021-10-21 19:22:48,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:22:48,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:22:48,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:22:48,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:22:48,203 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-10-21 19:22:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:22:48,256 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2021-10-21 19:22:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:22:48,257 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-10-21 19:22:48,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:22:48,258 INFO L225 Difference]: With dead ends: 83 [2021-10-21 19:22:48,258 INFO L226 Difference]: Without dead ends: 81 [2021-10-21 19:22:48,259 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:22:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-10-21 19:22:48,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 42. [2021-10-21 19:22:48,265 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-10-21 19:22:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-10-21 19:22:48,266 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2021-10-21 19:22:48,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:22:48,267 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-10-21 19:22:48,267 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-10-21 19:22:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-10-21 19:22:48,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-21 19:22:48,268 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:22:48,269 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:22:48,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 19:22:48,269 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-10-21 19:22:48,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:22:48,270 INFO L82 PathProgramCache]: Analyzing trace with hash 505160957, now seen corresponding path program 1 times [2021-10-21 19:22:48,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:22:48,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741393112] [2021-10-21 19:22:48,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:22:48,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:22:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:22:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:22:48,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:22:48,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741393112] [2021-10-21 19:22:48,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741393112] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:22:48,325 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:22:48,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:22:48,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878144753] [2021-10-21 19:22:48,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:22:48,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:22:48,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:22:48,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:22:48,328 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-10-21 19:22:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:22:48,410 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2021-10-21 19:22:48,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:22:48,421 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-10-21 19:22:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:22:48,421 INFO L225 Difference]: With dead ends: 57 [2021-10-21 19:22:48,422 INFO L226 Difference]: Without dead ends: 55 [2021-10-21 19:22:48,422 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:22:48,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-10-21 19:22:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2021-10-21 19:22:48,427 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-10-21 19:22:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-10-21 19:22:48,428 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2021-10-21 19:22:48,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:22:48,428 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-10-21 19:22:48,429 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-10-21 19:22:48,429 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-10-21 19:22:48,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-21 19:22:48,429 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:22:48,430 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:22:48,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 19:22:48,430 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-10-21 19:22:48,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:22:48,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1519875391, now seen corresponding path program 1 times [2021-10-21 19:22:48,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:22:48,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828737322] [2021-10-21 19:22:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:22:48,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:22:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:22:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:22:48,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:22:48,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828737322] [2021-10-21 19:22:48,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828737322] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:22:48,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:22:48,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:22:48,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666332307] [2021-10-21 19:22:48,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:22:48,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:22:48,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:22:48,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:22:48,496 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-10-21 19:22:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:22:48,540 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2021-10-21 19:22:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:22:48,541 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-10-21 19:22:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:22:48,542 INFO L225 Difference]: With dead ends: 57 [2021-10-21 19:22:48,542 INFO L226 Difference]: Without dead ends: 55 [2021-10-21 19:22:48,543 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:22:48,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-10-21 19:22:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2021-10-21 19:22:48,549 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-10-21 19:22:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-10-21 19:22:48,550 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2021-10-21 19:22:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:22:48,551 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-10-21 19:22:48,551 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-10-21 19:22:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-10-21 19:22:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-21 19:22:48,553 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:22:48,553 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:22:48,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 19:22:48,554 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-10-21 19:22:48,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:22:48,555 INFO L82 PathProgramCache]: Analyzing trace with hash 128507268, now seen corresponding path program 1 times [2021-10-21 19:22:48,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:22:48,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814444127] [2021-10-21 19:22:48,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:22:48,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:22:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:22:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:22:48,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:22:48,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814444127] [2021-10-21 19:22:48,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814444127] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:22:48,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:22:48,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:22:48,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083447902] [2021-10-21 19:22:48,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:22:48,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:22:48,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:22:48,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:22:48,613 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-10-21 19:22:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:22:48,665 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2021-10-21 19:22:48,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:22:48,666 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-10-21 19:22:48,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:22:48,667 INFO L225 Difference]: With dead ends: 65 [2021-10-21 19:22:48,667 INFO L226 Difference]: Without dead ends: 63 [2021-10-21 19:22:48,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:22:48,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-21 19:22:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2021-10-21 19:22:48,672 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-10-21 19:22:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2021-10-21 19:22:48,672 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2021-10-21 19:22:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:22:48,673 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-10-21 19:22:48,673 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-10-21 19:22:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2021-10-21 19:22:48,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-21 19:22:48,674 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:22:48,674 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:22:48,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 19:22:48,675 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-10-21 19:22:48,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:22:48,675 INFO L82 PathProgramCache]: Analyzing trace with hash -311237848, now seen corresponding path program 1 times [2021-10-21 19:22:48,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:22:48,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884063109] [2021-10-21 19:22:48,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:22:48,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:22:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:22:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:22:48,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:22:48,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884063109] [2021-10-21 19:22:48,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884063109] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:22:48,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:22:48,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:22:48,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031066574] [2021-10-21 19:22:48,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:22:48,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:22:48,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:22:48,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:22:48,717 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-10-21 19:22:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:22:48,805 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2021-10-21 19:22:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:22:48,806 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-10-21 19:22:48,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:22:48,807 INFO L225 Difference]: With dead ends: 70 [2021-10-21 19:22:48,807 INFO L226 Difference]: Without dead ends: 68 [2021-10-21 19:22:48,807 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:22:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-10-21 19:22:48,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 34. [2021-10-21 19:22:48,812 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-10-21 19:22:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-10-21 19:22:48,813 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2021-10-21 19:22:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:22:48,814 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-10-21 19:22:48,814 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-10-21 19:22:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-10-21 19:22:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-21 19:22:48,815 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:22:48,815 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:22:48,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 19:22:48,815 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-10-21 19:22:48,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:22:48,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1058434549, now seen corresponding path program 1 times [2021-10-21 19:22:48,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:22:48,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657945949] [2021-10-21 19:22:48,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:22:48,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:22:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:22:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:22:48,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:22:48,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657945949] [2021-10-21 19:22:48,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657945949] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:22:48,868 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:22:48,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:22:48,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758180649] [2021-10-21 19:22:48,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:22:48,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:22:48,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:22:48,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:22:48,870 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-10-21 19:22:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:22:48,981 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2021-10-21 19:22:48,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:22:48,982 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-10-21 19:22:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:22:48,983 INFO L225 Difference]: With dead ends: 58 [2021-10-21 19:22:48,983 INFO L226 Difference]: Without dead ends: 56 [2021-10-21 19:22:48,983 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 48.4ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:22:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-10-21 19:22:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2021-10-21 19:22:48,988 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-10-21 19:22:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-10-21 19:22:48,989 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2021-10-21 19:22:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:22:48,989 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-10-21 19:22:48,989 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-10-21 19:22:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-10-21 19:22:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-21 19:22:48,990 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:22:48,991 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-10-21 19:22:48,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 19:22:48,991 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-10-21 19:22:48,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:22:48,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1548271503, now seen corresponding path program 1 times [2021-10-21 19:22:48,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:22:48,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341741096] [2021-10-21 19:22:48,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:22:48,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:22:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:22:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:22:49,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:22:49,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341741096] [2021-10-21 19:22:49,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341741096] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:22:49,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:22:49,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:22:49,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577135530] [2021-10-21 19:22:49,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:22:49,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:22:49,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:22:49,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:22:49,034 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-10-21 19:22:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:22:49,135 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2021-10-21 19:22:49,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:22:49,136 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-10-21 19:22:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:22:49,137 INFO L225 Difference]: With dead ends: 83 [2021-10-21 19:22:49,137 INFO L226 Difference]: Without dead ends: 81 [2021-10-21 19:22:49,138 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 16.8ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:22:49,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-10-21 19:22:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 30. [2021-10-21 19:22:49,144 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-10-21 19:22:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-10-21 19:22:49,144 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2021-10-21 19:22:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:22:49,145 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-10-21 19:22:49,147 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-10-21 19:22:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-10-21 19:22:49,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-21 19:22:49,148 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:22:49,148 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-10-21 19:22:49,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 19:22:49,149 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-10-21 19:22:49,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:22:49,150 INFO L82 PathProgramCache]: Analyzing trace with hash 751780498, now seen corresponding path program 1 times [2021-10-21 19:22:49,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:22:49,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739783706] [2021-10-21 19:22:49,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:22:49,151 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:22:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:22:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:22:49,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:22:49,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739783706] [2021-10-21 19:22:49,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739783706] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:22:49,228 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:22:49,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:22:49,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997296245] [2021-10-21 19:22:49,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:22:49,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:22:49,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:22:49,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:22:49,230 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-10-21 19:22:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:22:49,335 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2021-10-21 19:22:49,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:22:49,336 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-10-21 19:22:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:22:49,337 INFO L225 Difference]: With dead ends: 56 [2021-10-21 19:22:49,337 INFO L226 Difference]: Without dead ends: 54 [2021-10-21 19:22:49,339 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 48.5ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:22:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-10-21 19:22:49,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 28. [2021-10-21 19:22:49,343 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-10-21 19:22:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-10-21 19:22:49,344 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2021-10-21 19:22:49,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:22:49,346 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-10-21 19:22:49,346 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-10-21 19:22:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-10-21 19:22:49,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-21 19:22:49,348 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:22:49,348 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-10-21 19:22:49,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 19:22:49,350 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-10-21 19:22:49,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:22:49,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1830363126, now seen corresponding path program 1 times [2021-10-21 19:22:49,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:22:49,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727144764] [2021-10-21 19:22:49,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:22:49,352 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:22:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:22:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:22:49,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:22:49,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727144764] [2021-10-21 19:22:49,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727144764] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:22:49,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:22:49,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:22:49,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158152982] [2021-10-21 19:22:49,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:22:49,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:22:49,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:22:49,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:22:49,425 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-10-21 19:22:49,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:22:49,576 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2021-10-21 19:22:49,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:22:49,576 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-10-21 19:22:49,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:22:49,577 INFO L225 Difference]: With dead ends: 121 [2021-10-21 19:22:49,577 INFO L226 Difference]: Without dead ends: 0 [2021-10-21 19:22:49,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 35.1ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:22:49,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-21 19:22:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-21 19:22:49,578 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-10-21 19:22:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-21 19:22:49,579 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2021-10-21 19:22:49,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:22:49,579 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-21 19:22:49,579 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-10-21 19:22:49,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-21 19:22:49,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-21 19:22:49,582 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:22:49,583 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:22:49,583 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:22:49,584 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:22:49,584 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:22:49,584 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:22:49,585 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:22:49,585 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:22:49,585 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:22:49,586 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:22:49,586 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:22:49,586 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:22:49,586 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:22:49,587 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:22:49,587 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:22:49,587 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:22:49,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 19:22:49,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-21 19:22:49,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:22:49,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:22:49,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:22:49,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:22:50,464 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-10-21 19:22:50,464 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2021-10-21 19:22:50,464 INFO L857 garLoopResultBuilder]: For program point L217(line 217) no Hoare annotation was computed. [2021-10-21 19:22:50,464 INFO L857 garLoopResultBuilder]: For program point L151(lines 151 281) no Hoare annotation was computed. [2021-10-21 19:22:50,464 INFO L857 garLoopResultBuilder]: For program point L110(lines 110 123) no Hoare annotation was computed. [2021-10-21 19:22:50,464 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2021-10-21 19:22:50,464 INFO L857 garLoopResultBuilder]: For program point L36(lines 36 300) no Hoare annotation was computed. [2021-10-21 19:22:50,465 INFO L857 garLoopResultBuilder]: For program point L193(line 193) no Hoare annotation was computed. [2021-10-21 19:22:50,465 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2021-10-21 19:22:50,465 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-21 19:22:50,465 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-21 19:22:50,465 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 127) no Hoare annotation was computed. [2021-10-21 19:22:50,465 INFO L857 garLoopResultBuilder]: For program point L20(lines 20 312) no Hoare annotation was computed. [2021-10-21 19:22:50,465 INFO L857 garLoopResultBuilder]: For program point L243(lines 243 267) no Hoare annotation was computed. [2021-10-21 19:22:50,465 INFO L857 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2021-10-21 19:22:50,465 INFO L857 garLoopResultBuilder]: For program point L45(lines 45 288) no Hoare annotation was computed. [2021-10-21 19:22:50,465 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2021-10-21 19:22:50,466 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-10-21 19:22:50,466 INFO L857 garLoopResultBuilder]: For program point L227(lines 227 269) no Hoare annotation was computed. [2021-10-21 19:22:50,466 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2021-10-21 19:22:50,466 INFO L857 garLoopResultBuilder]: For program point L153(line 153) no Hoare annotation was computed. [2021-10-21 19:22:50,466 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) no Hoare annotation was computed. [2021-10-21 19:22:50,466 INFO L860 garLoopResultBuilder]: At program point L310(lines 13 313) the Hoare annotation is: true [2021-10-21 19:22:50,467 INFO L857 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2021-10-21 19:22:50,467 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 245) no Hoare annotation was computed. [2021-10-21 19:22:50,467 INFO L857 garLoopResultBuilder]: For program point L203(lines 203 273) no Hoare annotation was computed. [2021-10-21 19:22:50,467 INFO L857 garLoopResultBuilder]: For program point L38(lines 38 294) no Hoare annotation was computed. [2021-10-21 19:22:50,467 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 141) no Hoare annotation was computed. [2021-10-21 19:22:50,467 INFO L857 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2021-10-21 19:22:50,467 INFO L857 garLoopResultBuilder]: For program point L245(line 245) no Hoare annotation was computed. [2021-10-21 19:22:50,467 INFO L857 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2021-10-21 19:22:50,467 INFO L857 garLoopResultBuilder]: For program point L229(line 229) no Hoare annotation was computed. [2021-10-21 19:22:50,468 INFO L857 garLoopResultBuilder]: For program point L163(lines 163 279) no Hoare annotation was computed. [2021-10-21 19:22:50,468 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2021-10-21 19:22:50,468 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-10-21 19:22:50,468 INFO L857 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2021-10-21 19:22:50,468 INFO L857 garLoopResultBuilder]: For program point L139(lines 139 283) no Hoare annotation was computed. [2021-10-21 19:22:50,468 INFO L857 garLoopResultBuilder]: For program point L98(lines 98 125) no Hoare annotation was computed. [2021-10-21 19:22:50,468 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-21 19:22:50,468 INFO L857 garLoopResultBuilder]: For program point L255(lines 255 265) no Hoare annotation was computed. [2021-10-21 19:22:50,468 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 165) no Hoare annotation was computed. [2021-10-21 19:22:50,469 INFO L857 garLoopResultBuilder]: For program point L57(lines 57 286) no Hoare annotation was computed. [2021-10-21 19:22:50,469 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2021-10-21 19:22:50,469 INFO L857 garLoopResultBuilder]: For program point L74(lines 74 129) no Hoare annotation was computed. [2021-10-21 19:22:50,469 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-10-21 19:22:50,469 INFO L857 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2021-10-21 19:22:50,469 INFO L857 garLoopResultBuilder]: For program point L66(lines 66 285) no Hoare annotation was computed. [2021-10-21 19:22:50,469 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-21 19:22:50,470 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 153) no Hoare annotation was computed. [2021-10-21 19:22:50,470 INFO L857 garLoopResultBuilder]: For program point L215(lines 215 271) no Hoare annotation was computed. [2021-10-21 19:22:50,470 INFO L857 garLoopResultBuilder]: For program point L141(line 141) no Hoare annotation was computed. [2021-10-21 19:22:50,470 INFO L857 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2021-10-21 19:22:50,470 INFO L857 garLoopResultBuilder]: For program point L257(line 257) no Hoare annotation was computed. [2021-10-21 19:22:50,470 INFO L857 garLoopResultBuilder]: For program point L191(lines 191 275) no Hoare annotation was computed. [2021-10-21 19:22:50,470 INFO L857 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2021-10-21 19:22:50,470 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 193) no Hoare annotation was computed. [2021-10-21 19:22:50,470 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2021-10-21 19:22:50,471 INFO L857 garLoopResultBuilder]: For program point L175(lines 175 277) no Hoare annotation was computed. [2021-10-21 19:22:50,471 INFO L857 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2021-10-21 19:22:50,471 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 229) no Hoare annotation was computed. [2021-10-21 19:22:50,476 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 19:22:50,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 07:22:50 BoogieIcfgContainer [2021-10-21 19:22:50,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 19:22:50,494 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:22:50,494 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:22:50,494 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:22:50,495 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:22:46" (3/4) ... [2021-10-21 19:22:50,498 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-21 19:22:50,510 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-21 19:22:50,511 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-21 19:22:50,511 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-21 19:22:50,512 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-21 19:22:50,563 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:22:50,564 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:22:50,565 INFO L168 Benchmark]: Toolchain (without parser) took 5049.20 ms. Allocated memory was 83.9 MB in the beginning and 127.9 MB in the end (delta: 44.0 MB). Free memory was 45.5 MB in the beginning and 40.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 50.8 MB. Max. memory is 16.1 GB. [2021-10-21 19:22:50,565 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 83.9 MB. Free memory is still 62.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:22:50,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.14 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 45.3 MB in the beginning and 69.1 MB in the end (delta: -23.8 MB). Peak memory consumption was 8.2 MB. Max. memory is 16.1 GB. [2021-10-21 19:22:50,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.21 ms. Allocated memory is still 100.7 MB. Free memory was 69.1 MB in the beginning and 67.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:22:50,567 INFO L168 Benchmark]: Boogie Preprocessor took 24.17 ms. Allocated memory is still 100.7 MB. Free memory was 67.0 MB in the beginning and 66.0 MB in the end (delta: 994.5 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:22:50,567 INFO L168 Benchmark]: RCFGBuilder took 418.96 ms. Allocated memory is still 100.7 MB. Free memory was 66.0 MB in the beginning and 52.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-21 19:22:50,568 INFO L168 Benchmark]: TraceAbstraction took 4173.48 ms. Allocated memory was 100.7 MB in the beginning and 127.9 MB in the end (delta: 27.3 MB). Free memory was 52.3 MB in the beginning and 45.9 MB in the end (delta: 6.4 MB). Peak memory consumption was 43.0 MB. Max. memory is 16.1 GB. [2021-10-21 19:22:50,568 INFO L168 Benchmark]: Witness Printer took 69.89 ms. Allocated memory is still 127.9 MB. Free memory was 45.9 MB in the beginning and 40.7 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-21 19:22:50,571 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.21 ms. Allocated memory is still 83.9 MB. Free memory is still 62.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 311.14 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 45.3 MB in the beginning and 69.1 MB in the end (delta: -23.8 MB). Peak memory consumption was 8.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 45.21 ms. Allocated memory is still 100.7 MB. Free memory was 69.1 MB in the beginning and 67.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.17 ms. Allocated memory is still 100.7 MB. Free memory was 67.0 MB in the beginning and 66.0 MB in the end (delta: 994.5 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 418.96 ms. Allocated memory is still 100.7 MB. Free memory was 66.0 MB in the beginning and 52.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4173.48 ms. Allocated memory was 100.7 MB in the beginning and 127.9 MB in the end (delta: 27.3 MB). Free memory was 52.3 MB in the beginning and 45.9 MB in the end (delta: 6.4 MB). Peak memory consumption was 43.0 MB. Max. memory is 16.1 GB. * Witness Printer took 69.89 ms. Allocated memory is still 127.9 MB. Free memory was 45.9 MB in the beginning and 40.7 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 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: 4044.5ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 22.7ms, AutomataDifference: 1505.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 875.4ms, InitialAbstractionConstructionTime: 23.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 883 SDtfs, 1267 SDslu, 709 SDs, 0 SdLazy, 900 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 707.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 360.9ms 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: 131.1ms AutomataMinimizationTime, 16 MinimizatonAttempts, 436 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 25 NumberOfFragments, 135 HoareAnnotationTreeSize, 4 FomulaSimplifications, 233224006 FormulaSimplificationTreeSizeReduction, 411.3ms HoareSimplificationTime, 4 FomulaSimplificationsInter, 74415 FormulaSimplificationTreeSizeReductionInter, 456.1ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 55.9ms SsaConstructionTime, 278.2ms SatisfiabilityAnalysisTime, 833.4ms 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-10-21 19:22:50,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a040ce43-e8c1-4df5-b607-f7298dcbea3b/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...