./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 b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg/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_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg --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-b2eff8b [2021-10-28 09:18:52,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:18:52,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:18:52,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:18:52,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:18:52,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:18:52,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:18:52,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:18:52,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:18:52,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:18:52,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:18:52,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:18:52,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:18:52,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:18:52,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:18:52,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:18:52,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:18:52,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:18:52,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:18:52,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:18:52,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:18:52,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:18:52,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:18:52,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:18:52,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:18:52,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:18:52,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:18:52,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:18:52,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:18:52,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:18:52,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:18:52,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:18:52,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:18:52,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:18:52,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:18:52,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:18:52,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:18:52,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:18:52,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:18:52,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:18:52,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:18:52,945 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 09:18:52,989 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:18:52,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:18:52,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:18:52,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:18:52,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:18:52,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:18:52,998 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:18:52,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:18:52,999 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:18:52,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:18:53,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:18:53,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:18:53,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:18:53,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:18:53,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:18:53,002 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:18:53,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:18:53,002 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:18:53,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:18:53,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:18:53,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:18:53,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:18:53,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:18:53,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:18:53,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:18:53,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:18:53,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:18:53,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:18:53,006 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:18:53,007 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:18:53,008 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:18:53,008 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:18:53,008 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_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg/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_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg 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-28 09:18:53,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:18:53,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:18:53,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:18:53,277 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:18:53,278 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:18:53,279 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-10-28 09:18:53,330 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg/data/bc675e560/c3fec237cdf74e4997f15f5d0a0bb362/FLAGe99d509bc [2021-10-28 09:18:53,749 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:18:53,749 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-10-28 09:18:53,756 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg/data/bc675e560/c3fec237cdf74e4997f15f5d0a0bb362/FLAGe99d509bc [2021-10-28 09:18:54,169 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg/data/bc675e560/c3fec237cdf74e4997f15f5d0a0bb362 [2021-10-28 09:18:54,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:18:54,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:18:54,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:18:54,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:18:54,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:18:54,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:18:54" (1/1) ... [2021-10-28 09:18:54,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b5592db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:54, skipping insertion in model container [2021-10-28 09:18:54,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:18:54" (1/1) ... [2021-10-28 09:18:54,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:18:54,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:18:54,396 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-10-28 09:18:54,400 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-10-28 09:18:54,403 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-10-28 09:18:54,405 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-10-28 09:18:54,406 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-10-28 09:18:54,408 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-10-28 09:18:54,411 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-10-28 09:18:54,413 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-10-28 09:18:54,415 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-10-28 09:18:54,416 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-10-28 09:18:54,419 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-10-28 09:18:54,421 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-10-28 09:18:54,423 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-10-28 09:18:54,425 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-10-28 09:18:54,427 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-10-28 09:18:54,429 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-10-28 09:18:54,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:18:54,440 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:18:54,455 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-10-28 09:18:54,456 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-10-28 09:18:54,458 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-10-28 09:18:54,459 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-10-28 09:18:54,461 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-10-28 09:18:54,462 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-10-28 09:18:54,464 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-10-28 09:18:54,466 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-10-28 09:18:54,467 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-10-28 09:18:54,468 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-10-28 09:18:54,470 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-10-28 09:18:54,471 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-10-28 09:18:54,473 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-10-28 09:18:54,474 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-10-28 09:18:54,476 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-10-28 09:18:54,478 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_8b4cdac4-3474-4db3-930d-d67caee0474f/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-10-28 09:18:54,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:18:54,492 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:18:54,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:54 WrapperNode [2021-10-28 09:18:54,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:18:54,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:18:54,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:18:54,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:18:54,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:54" (1/1) ... [2021-10-28 09:18:54,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:54" (1/1) ... [2021-10-28 09:18:54,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:18:54,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:18:54,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:18:54,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:18:54,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:54" (1/1) ... [2021-10-28 09:18:54,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:54" (1/1) ... [2021-10-28 09:18:54,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:54" (1/1) ... [2021-10-28 09:18:54,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:54" (1/1) ... [2021-10-28 09:18:54,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:54" (1/1) ... [2021-10-28 09:18:54,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:54" (1/1) ... [2021-10-28 09:18:54,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:54" (1/1) ... [2021-10-28 09:18:54,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:18:54,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:18:54,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:18:54,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:18:54,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:54" (1/1) ... [2021-10-28 09:18:54,578 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:18:54,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:18:54,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:18:54,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:18:54,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:18:54,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:18:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:18:54,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:18:54,893 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:18:54,893 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-28 09:18:54,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:18:54 BoogieIcfgContainer [2021-10-28 09:18:54,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:18:54,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:18:54,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:18:54,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:18:54,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:18:54" (1/3) ... [2021-10-28 09:18:54,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190faebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:18:54, skipping insertion in model container [2021-10-28 09:18:54,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:54" (2/3) ... [2021-10-28 09:18:54,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190faebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:18:54, skipping insertion in model container [2021-10-28 09:18:54,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:18:54" (3/3) ... [2021-10-28 09:18:54,903 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2021-10-28 09:18:54,908 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:18:54,909 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2021-10-28 09:18:54,953 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:18:54,959 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-28 09:18:54,959 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-10-28 09:18:54,975 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-28 09:18:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-28 09:18:54,979 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:18:54,980 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:54,980 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-28 09:18:54,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:54,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1241029004, now seen corresponding path program 1 times [2021-10-28 09:18:54,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:54,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756893413] [2021-10-28 09:18:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:54,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:55,170 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-28 09:18:55,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:55,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756893413] [2021-10-28 09:18:55,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756893413] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:55,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:55,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:18:55,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879430436] [2021-10-28 09:18:55,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:18:55,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:55,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:18:55,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:18:55,211 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-28 09:18:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:18:55,254 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2021-10-28 09:18:55,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:18:55,265 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-28 09:18:55,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:18:55,272 INFO L225 Difference]: With dead ends: 83 [2021-10-28 09:18:55,272 INFO L226 Difference]: Without dead ends: 72 [2021-10-28 09:18:55,274 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:18:55,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-10-28 09:18:55,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2021-10-28 09:18:55,306 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-28 09:18:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2021-10-28 09:18:55,311 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 9 [2021-10-28 09:18:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:18:55,312 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-10-28 09:18:55,312 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-28 09:18:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2021-10-28 09:18:55,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-28 09:18:55,315 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:18:55,316 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:55,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:18:55,317 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-28 09:18:55,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:55,323 INFO L85 PathProgramCache]: Analyzing trace with hash -182802478, now seen corresponding path program 1 times [2021-10-28 09:18:55,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:55,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437635284] [2021-10-28 09:18:55,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:55,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:55,407 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-28 09:18:55,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:55,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437635284] [2021-10-28 09:18:55,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437635284] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:55,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:55,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:18:55,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349244487] [2021-10-28 09:18:55,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:18:55,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:55,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:18:55,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:18:55,412 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-28 09:18:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:18:55,478 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2021-10-28 09:18:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:18:55,480 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-28 09:18:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:18:55,483 INFO L225 Difference]: With dead ends: 73 [2021-10-28 09:18:55,484 INFO L226 Difference]: Without dead ends: 71 [2021-10-28 09:18:55,486 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:18:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-10-28 09:18:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2021-10-28 09:18:55,494 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-28 09:18:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2021-10-28 09:18:55,501 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2021-10-28 09:18:55,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:18:55,502 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2021-10-28 09:18:55,502 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-28 09:18:55,502 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2021-10-28 09:18:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-28 09:18:55,503 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:18:55,503 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:55,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:18:55,503 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-28 09:18:55,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:55,505 INFO L85 PathProgramCache]: Analyzing trace with hash -179156060, now seen corresponding path program 1 times [2021-10-28 09:18:55,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:55,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193152103] [2021-10-28 09:18:55,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:55,508 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:55,577 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-28 09:18:55,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:55,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193152103] [2021-10-28 09:18:55,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193152103] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:55,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:55,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:18:55,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673054255] [2021-10-28 09:18:55,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:18:55,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:55,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:18:55,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:18:55,580 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-28 09:18:55,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:18:55,658 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2021-10-28 09:18:55,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:18:55,658 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-28 09:18:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:18:55,660 INFO L225 Difference]: With dead ends: 143 [2021-10-28 09:18:55,660 INFO L226 Difference]: Without dead ends: 93 [2021-10-28 09:18:55,661 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:18:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-10-28 09:18:55,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2021-10-28 09:18:55,668 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-28 09:18:55,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-10-28 09:18:55,669 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2021-10-28 09:18:55,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:18:55,670 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-10-28 09:18:55,670 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-28 09:18:55,670 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-10-28 09:18:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-28 09:18:55,671 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:18:55,671 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:55,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:18:55,672 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-28 09:18:55,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:55,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1258866483, now seen corresponding path program 1 times [2021-10-28 09:18:55,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:55,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970521360] [2021-10-28 09:18:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:55,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:55,762 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-28 09:18:55,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:55,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970521360] [2021-10-28 09:18:55,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970521360] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:55,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:55,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:18:55,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226795709] [2021-10-28 09:18:55,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:18:55,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:55,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:18:55,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:18:55,767 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-28 09:18:55,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:18:55,870 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2021-10-28 09:18:55,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:18:55,874 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-28 09:18:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:18:55,875 INFO L225 Difference]: With dead ends: 92 [2021-10-28 09:18:55,875 INFO L226 Difference]: Without dead ends: 90 [2021-10-28 09:18:55,876 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:18:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-10-28 09:18:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 50. [2021-10-28 09:18:55,882 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-28 09:18:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-10-28 09:18:55,883 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2021-10-28 09:18:55,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:18:55,883 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-10-28 09:18:55,884 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-28 09:18:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-10-28 09:18:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-28 09:18:55,884 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:18:55,885 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:55,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:18:55,885 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-28 09:18:55,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:55,886 INFO L85 PathProgramCache]: Analyzing trace with hash 420636790, now seen corresponding path program 1 times [2021-10-28 09:18:55,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:55,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831816490] [2021-10-28 09:18:55,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:55,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:56,004 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-28 09:18:56,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:56,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831816490] [2021-10-28 09:18:56,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831816490] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:56,005 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:56,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:18:56,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349004075] [2021-10-28 09:18:56,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:18:56,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:56,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:18:56,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:18:56,007 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-28 09:18:56,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:18:56,056 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2021-10-28 09:18:56,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:18:56,056 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-28 09:18:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:18:56,057 INFO L225 Difference]: With dead ends: 69 [2021-10-28 09:18:56,057 INFO L226 Difference]: Without dead ends: 67 [2021-10-28 09:18:56,058 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:18:56,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-10-28 09:18:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2021-10-28 09:18:56,063 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-28 09:18:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2021-10-28 09:18:56,064 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2021-10-28 09:18:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:18:56,065 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-10-28 09:18:56,065 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-28 09:18:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2021-10-28 09:18:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-28 09:18:56,066 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:18:56,066 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:56,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:18:56,066 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-28 09:18:56,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:56,067 INFO L85 PathProgramCache]: Analyzing trace with hash -370151221, now seen corresponding path program 1 times [2021-10-28 09:18:56,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:56,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182363533] [2021-10-28 09:18:56,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:56,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:56,142 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-28 09:18:56,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:56,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182363533] [2021-10-28 09:18:56,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182363533] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:56,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:56,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:18:56,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610490697] [2021-10-28 09:18:56,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:18:56,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:56,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:18:56,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:18:56,149 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-28 09:18:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:18:56,262 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2021-10-28 09:18:56,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:18:56,263 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-28 09:18:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:18:56,266 INFO L225 Difference]: With dead ends: 87 [2021-10-28 09:18:56,266 INFO L226 Difference]: Without dead ends: 85 [2021-10-28 09:18:56,267 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:18:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-10-28 09:18:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2021-10-28 09:18:56,277 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-28 09:18:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-10-28 09:18:56,278 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 12 [2021-10-28 09:18:56,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:18:56,278 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-10-28 09:18:56,278 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-28 09:18:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-10-28 09:18:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-28 09:18:56,279 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:18:56,279 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:56,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:18:56,280 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-28 09:18:56,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:56,280 INFO L85 PathProgramCache]: Analyzing trace with hash 154842714, now seen corresponding path program 1 times [2021-10-28 09:18:56,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:56,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91150710] [2021-10-28 09:18:56,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:56,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:18:56,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:56,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91150710] [2021-10-28 09:18:56,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91150710] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:56,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:56,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:18:56,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664108643] [2021-10-28 09:18:56,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:18:56,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:56,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:18:56,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:18:56,339 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-28 09:18:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:18:56,458 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2021-10-28 09:18:56,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:18:56,458 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-28 09:18:56,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:18:56,461 INFO L225 Difference]: With dead ends: 75 [2021-10-28 09:18:56,465 INFO L226 Difference]: Without dead ends: 73 [2021-10-28 09:18:56,467 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:18:56,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-10-28 09:18:56,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2021-10-28 09:18:56,480 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-28 09:18:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2021-10-28 09:18:56,481 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 13 [2021-10-28 09:18:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:18:56,482 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2021-10-28 09:18:56,482 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-28 09:18:56,483 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2021-10-28 09:18:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-28 09:18:56,483 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:18:56,484 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:56,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:18:56,484 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-28 09:18:56,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1410218132, now seen corresponding path program 1 times [2021-10-28 09:18:56,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:56,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232871894] [2021-10-28 09:18:56,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:56,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:56,561 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-28 09:18:56,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:56,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232871894] [2021-10-28 09:18:56,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232871894] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:56,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:56,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:18:56,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033738465] [2021-10-28 09:18:56,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:18:56,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:56,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:18:56,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:18:56,568 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-28 09:18:56,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:18:56,619 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2021-10-28 09:18:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:18:56,620 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-28 09:18:56,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:18:56,621 INFO L225 Difference]: With dead ends: 83 [2021-10-28 09:18:56,621 INFO L226 Difference]: Without dead ends: 81 [2021-10-28 09:18:56,623 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:18:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-10-28 09:18:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 42. [2021-10-28 09:18:56,639 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-28 09:18:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-10-28 09:18:56,641 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2021-10-28 09:18:56,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:18:56,642 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-10-28 09:18:56,642 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-28 09:18:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-10-28 09:18:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-28 09:18:56,643 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:18:56,643 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:56,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:18:56,643 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-28 09:18:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash 505160957, now seen corresponding path program 1 times [2021-10-28 09:18:56,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:56,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281952869] [2021-10-28 09:18:56,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:56,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:56,723 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-28 09:18:56,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:56,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281952869] [2021-10-28 09:18:56,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281952869] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:56,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:56,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:18:56,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542235582] [2021-10-28 09:18:56,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:18:56,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:56,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:18:56,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:18:56,728 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-28 09:18:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:18:56,797 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2021-10-28 09:18:56,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:18:56,798 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-28 09:18:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:18:56,799 INFO L225 Difference]: With dead ends: 57 [2021-10-28 09:18:56,799 INFO L226 Difference]: Without dead ends: 55 [2021-10-28 09:18:56,800 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:18:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-10-28 09:18:56,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2021-10-28 09:18:56,808 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-28 09:18:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-10-28 09:18:56,810 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2021-10-28 09:18:56,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:18:56,810 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-10-28 09:18:56,811 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-28 09:18:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-10-28 09:18:56,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-28 09:18:56,812 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:18:56,812 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:56,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:18:56,813 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-28 09:18:56,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:56,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1519875391, now seen corresponding path program 1 times [2021-10-28 09:18:56,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:56,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003275341] [2021-10-28 09:18:56,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:56,815 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:56,885 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-28 09:18:56,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:56,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003275341] [2021-10-28 09:18:56,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003275341] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:56,886 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:56,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:18:56,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085045451] [2021-10-28 09:18:56,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:18:56,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:56,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:18:56,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:18:56,888 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-28 09:18:56,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:18:56,926 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2021-10-28 09:18:56,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:18:56,926 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-28 09:18:56,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:18:56,927 INFO L225 Difference]: With dead ends: 57 [2021-10-28 09:18:56,927 INFO L226 Difference]: Without dead ends: 55 [2021-10-28 09:18:56,928 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:18:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-10-28 09:18:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2021-10-28 09:18:56,932 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-28 09:18:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-10-28 09:18:56,933 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2021-10-28 09:18:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:18:56,933 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-10-28 09:18:56,933 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-28 09:18:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-10-28 09:18:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 09:18:56,934 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:18:56,934 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:56,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:18:56,935 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-28 09:18:56,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:56,936 INFO L85 PathProgramCache]: Analyzing trace with hash 128507268, now seen corresponding path program 1 times [2021-10-28 09:18:56,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:56,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486722617] [2021-10-28 09:18:56,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:56,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:56,992 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-28 09:18:56,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:56,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486722617] [2021-10-28 09:18:56,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486722617] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:56,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:56,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:18:56,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037708665] [2021-10-28 09:18:56,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:18:56,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:56,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:18:56,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:18:56,995 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-28 09:18:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:18:57,046 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2021-10-28 09:18:57,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:18:57,047 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-28 09:18:57,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:18:57,048 INFO L225 Difference]: With dead ends: 65 [2021-10-28 09:18:57,048 INFO L226 Difference]: Without dead ends: 63 [2021-10-28 09:18:57,048 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:18:57,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-28 09:18:57,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2021-10-28 09:18:57,053 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-28 09:18:57,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2021-10-28 09:18:57,053 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2021-10-28 09:18:57,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:18:57,055 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-10-28 09:18:57,055 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-28 09:18:57,056 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2021-10-28 09:18:57,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 09:18:57,058 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:18:57,058 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:57,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:18:57,059 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-28 09:18:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash -311237848, now seen corresponding path program 1 times [2021-10-28 09:18:57,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:57,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052681174] [2021-10-28 09:18:57,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:57,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:57,123 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-28 09:18:57,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:57,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052681174] [2021-10-28 09:18:57,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052681174] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:57,125 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:57,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:18:57,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099143966] [2021-10-28 09:18:57,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:18:57,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:57,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:18:57,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:18:57,127 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-28 09:18:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:18:57,226 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2021-10-28 09:18:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:18:57,227 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-28 09:18:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:18:57,228 INFO L225 Difference]: With dead ends: 70 [2021-10-28 09:18:57,228 INFO L226 Difference]: Without dead ends: 68 [2021-10-28 09:18:57,228 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:18:57,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-10-28 09:18:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 34. [2021-10-28 09:18:57,239 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-28 09:18:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-10-28 09:18:57,239 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2021-10-28 09:18:57,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:18:57,240 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-10-28 09:18:57,240 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-28 09:18:57,240 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-10-28 09:18:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 09:18:57,245 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:18:57,246 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:57,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:18:57,246 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-28 09:18:57,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:57,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1058434549, now seen corresponding path program 1 times [2021-10-28 09:18:57,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:57,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065875030] [2021-10-28 09:18:57,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:57,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:57,307 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-28 09:18:57,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:57,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065875030] [2021-10-28 09:18:57,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065875030] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:57,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:57,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:18:57,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071220428] [2021-10-28 09:18:57,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:18:57,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:57,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:18:57,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:18:57,310 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-28 09:18:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:18:57,405 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2021-10-28 09:18:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 09:18:57,405 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-28 09:18:57,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:18:57,406 INFO L225 Difference]: With dead ends: 58 [2021-10-28 09:18:57,406 INFO L226 Difference]: Without dead ends: 56 [2021-10-28 09:18:57,407 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-10-28 09:18:57,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-10-28 09:18:57,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2021-10-28 09:18:57,411 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-28 09:18:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-10-28 09:18:57,411 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2021-10-28 09:18:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:18:57,411 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-10-28 09:18:57,412 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-28 09:18:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-10-28 09:18:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 09:18:57,412 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:18:57,413 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:57,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:18:57,413 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-28 09:18:57,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:57,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1548271503, now seen corresponding path program 1 times [2021-10-28 09:18:57,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:57,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605460298] [2021-10-28 09:18:57,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:57,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:57,447 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-28 09:18:57,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:57,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605460298] [2021-10-28 09:18:57,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605460298] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:57,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:57,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:18:57,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790567008] [2021-10-28 09:18:57,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:18:57,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:57,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:18:57,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:18:57,450 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-28 09:18:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:18:57,548 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2021-10-28 09:18:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:18:57,549 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-28 09:18:57,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:18:57,550 INFO L225 Difference]: With dead ends: 83 [2021-10-28 09:18:57,550 INFO L226 Difference]: Without dead ends: 81 [2021-10-28 09:18:57,550 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:18:57,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-10-28 09:18:57,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 30. [2021-10-28 09:18:57,555 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-28 09:18:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-10-28 09:18:57,555 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2021-10-28 09:18:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:18:57,556 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-10-28 09:18:57,556 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-28 09:18:57,556 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-10-28 09:18:57,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 09:18:57,557 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:18:57,557 INFO L513 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-28 09:18:57,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 09:18:57,557 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-28 09:18:57,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:57,558 INFO L85 PathProgramCache]: Analyzing trace with hash 751780498, now seen corresponding path program 1 times [2021-10-28 09:18:57,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:57,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126549785] [2021-10-28 09:18:57,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:57,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:57,606 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-28 09:18:57,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:57,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126549785] [2021-10-28 09:18:57,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126549785] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:57,607 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:57,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:18:57,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873027004] [2021-10-28 09:18:57,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:18:57,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:57,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:18:57,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:18:57,609 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-28 09:18:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:18:57,702 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2021-10-28 09:18:57,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 09:18:57,702 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-28 09:18:57,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:18:57,703 INFO L225 Difference]: With dead ends: 56 [2021-10-28 09:18:57,703 INFO L226 Difference]: Without dead ends: 54 [2021-10-28 09:18:57,704 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-10-28 09:18:57,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-10-28 09:18:57,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 28. [2021-10-28 09:18:57,708 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-28 09:18:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-10-28 09:18:57,709 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2021-10-28 09:18:57,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:18:57,709 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-10-28 09:18:57,709 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-28 09:18:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-10-28 09:18:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 09:18:57,710 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:18:57,710 INFO L513 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-28 09:18:57,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 09:18:57,711 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-28 09:18:57,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:57,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1830363126, now seen corresponding path program 1 times [2021-10-28 09:18:57,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:57,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786000012] [2021-10-28 09:18:57,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:57,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:57,755 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-28 09:18:57,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:57,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786000012] [2021-10-28 09:18:57,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786000012] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:57,756 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:57,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:18:57,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114050529] [2021-10-28 09:18:57,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:18:57,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:57,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:18:57,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:18:57,758 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-28 09:18:57,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:18:57,897 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2021-10-28 09:18:57,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 09:18:57,898 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-28 09:18:57,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:18:57,898 INFO L225 Difference]: With dead ends: 121 [2021-10-28 09:18:57,898 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 09:18:57,899 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:18:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 09:18:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 09:18:57,900 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-28 09:18:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 09:18:57,900 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2021-10-28 09:18:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:18:57,901 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 09:18:57,901 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-28 09:18:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 09:18:57,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 09:18:57,903 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:18:57,904 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:18:57,904 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:18:57,905 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:18:57,905 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:18:57,905 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:18:57,905 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:18:57,906 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:18:57,906 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:18:57,906 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:18:57,906 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:18:57,907 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:18:57,907 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:18:57,907 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:18:57,907 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:18:57,907 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:18:57,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 09:18:57,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 09:18:57,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:18:58,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:18:58,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:18:58,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:18:58,703 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-10-28 09:18:58,703 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2021-10-28 09:18:58,703 INFO L857 garLoopResultBuilder]: For program point L217(line 217) no Hoare annotation was computed. [2021-10-28 09:18:58,703 INFO L857 garLoopResultBuilder]: For program point L151(lines 151 281) no Hoare annotation was computed. [2021-10-28 09:18:58,703 INFO L857 garLoopResultBuilder]: For program point L110(lines 110 123) no Hoare annotation was computed. [2021-10-28 09:18:58,704 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2021-10-28 09:18:58,704 INFO L857 garLoopResultBuilder]: For program point L36(lines 36 300) no Hoare annotation was computed. [2021-10-28 09:18:58,704 INFO L857 garLoopResultBuilder]: For program point L193(line 193) no Hoare annotation was computed. [2021-10-28 09:18:58,704 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2021-10-28 09:18:58,704 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 09:18:58,704 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 09:18:58,704 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 127) no Hoare annotation was computed. [2021-10-28 09:18:58,704 INFO L857 garLoopResultBuilder]: For program point L20(lines 20 312) no Hoare annotation was computed. [2021-10-28 09:18:58,704 INFO L857 garLoopResultBuilder]: For program point L243(lines 243 267) no Hoare annotation was computed. [2021-10-28 09:18:58,705 INFO L857 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2021-10-28 09:18:58,705 INFO L857 garLoopResultBuilder]: For program point L45(lines 45 288) no Hoare annotation was computed. [2021-10-28 09:18:58,705 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2021-10-28 09:18:58,705 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-28 09:18:58,705 INFO L857 garLoopResultBuilder]: For program point L227(lines 227 269) no Hoare annotation was computed. [2021-10-28 09:18:58,706 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2021-10-28 09:18:58,706 INFO L857 garLoopResultBuilder]: For program point L153(line 153) no Hoare annotation was computed. [2021-10-28 09:18:58,706 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) no Hoare annotation was computed. [2021-10-28 09:18:58,706 INFO L860 garLoopResultBuilder]: At program point L310(lines 13 313) the Hoare annotation is: true [2021-10-28 09:18:58,706 INFO L857 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2021-10-28 09:18:58,706 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 245) no Hoare annotation was computed. [2021-10-28 09:18:58,706 INFO L857 garLoopResultBuilder]: For program point L203(lines 203 273) no Hoare annotation was computed. [2021-10-28 09:18:58,706 INFO L857 garLoopResultBuilder]: For program point L38(lines 38 294) no Hoare annotation was computed. [2021-10-28 09:18:58,706 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 141) no Hoare annotation was computed. [2021-10-28 09:18:58,707 INFO L857 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2021-10-28 09:18:58,707 INFO L857 garLoopResultBuilder]: For program point L245(line 245) no Hoare annotation was computed. [2021-10-28 09:18:58,707 INFO L857 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2021-10-28 09:18:58,707 INFO L857 garLoopResultBuilder]: For program point L229(line 229) no Hoare annotation was computed. [2021-10-28 09:18:58,707 INFO L857 garLoopResultBuilder]: For program point L163(lines 163 279) no Hoare annotation was computed. [2021-10-28 09:18:58,707 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2021-10-28 09:18:58,707 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-28 09:18:58,708 INFO L857 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2021-10-28 09:18:58,708 INFO L857 garLoopResultBuilder]: For program point L139(lines 139 283) no Hoare annotation was computed. [2021-10-28 09:18:58,708 INFO L857 garLoopResultBuilder]: For program point L98(lines 98 125) no Hoare annotation was computed. [2021-10-28 09:18:58,708 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 09:18:58,708 INFO L857 garLoopResultBuilder]: For program point L255(lines 255 265) no Hoare annotation was computed. [2021-10-28 09:18:58,708 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 165) no Hoare annotation was computed. [2021-10-28 09:18:58,708 INFO L857 garLoopResultBuilder]: For program point L57(lines 57 286) no Hoare annotation was computed. [2021-10-28 09:18:58,708 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2021-10-28 09:18:58,709 INFO L857 garLoopResultBuilder]: For program point L74(lines 74 129) no Hoare annotation was computed. [2021-10-28 09:18:58,709 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-28 09:18:58,709 INFO L857 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2021-10-28 09:18:58,709 INFO L857 garLoopResultBuilder]: For program point L66(lines 66 285) no Hoare annotation was computed. [2021-10-28 09:18:58,709 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 09:18:58,710 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 153) no Hoare annotation was computed. [2021-10-28 09:18:58,710 INFO L857 garLoopResultBuilder]: For program point L215(lines 215 271) no Hoare annotation was computed. [2021-10-28 09:18:58,711 INFO L857 garLoopResultBuilder]: For program point L141(line 141) no Hoare annotation was computed. [2021-10-28 09:18:58,711 INFO L857 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2021-10-28 09:18:58,711 INFO L857 garLoopResultBuilder]: For program point L257(line 257) no Hoare annotation was computed. [2021-10-28 09:18:58,711 INFO L857 garLoopResultBuilder]: For program point L191(lines 191 275) no Hoare annotation was computed. [2021-10-28 09:18:58,711 INFO L857 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2021-10-28 09:18:58,711 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 193) no Hoare annotation was computed. [2021-10-28 09:18:58,712 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2021-10-28 09:18:58,712 INFO L857 garLoopResultBuilder]: For program point L175(lines 175 277) no Hoare annotation was computed. [2021-10-28 09:18:58,712 INFO L857 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2021-10-28 09:18:58,712 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 229) no Hoare annotation was computed. [2021-10-28 09:18:58,715 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:58,717 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:18:58,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:18:58 BoogieIcfgContainer [2021-10-28 09:18:58,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:18:58,734 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:18:58,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:18:58,734 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:18:58,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:18:54" (3/4) ... [2021-10-28 09:18:58,737 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 09:18:58,749 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-28 09:18:58,750 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-28 09:18:58,750 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 09:18:58,751 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 09:18:58,800 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:18:58,800 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:18:58,802 INFO L168 Benchmark]: Toolchain (without parser) took 4626.16 ms. Allocated memory was 123.7 MB in the beginning and 148.9 MB in the end (delta: 25.2 MB). Free memory was 93.3 MB in the beginning and 96.6 MB in the end (delta: -3.3 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:18:58,802 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 90.2 MB. Free memory is still 48.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:18:58,803 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.51 ms. Allocated memory is still 123.7 MB. Free memory was 93.3 MB in the beginning and 94.6 MB in the end (delta: -1.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:18:58,803 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.54 ms. Allocated memory is still 123.7 MB. Free memory was 94.6 MB in the beginning and 92.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:18:58,803 INFO L168 Benchmark]: Boogie Preprocessor took 31.03 ms. Allocated memory is still 123.7 MB. Free memory was 92.6 MB in the beginning and 91.6 MB in the end (delta: 960.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:18:58,804 INFO L168 Benchmark]: RCFGBuilder took 325.46 ms. Allocated memory is still 123.7 MB. Free memory was 91.4 MB in the beginning and 77.9 MB in the end (delta: 13.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-28 09:18:58,804 INFO L168 Benchmark]: TraceAbstraction took 3836.36 ms. Allocated memory was 123.7 MB in the beginning and 148.9 MB in the end (delta: 25.2 MB). Free memory was 77.4 MB in the beginning and 101.8 MB in the end (delta: -24.4 MB). Peak memory consumption was 56.0 MB. Max. memory is 16.1 GB. [2021-10-28 09:18:58,804 INFO L168 Benchmark]: Witness Printer took 66.56 ms. Allocated memory is still 148.9 MB. Free memory was 101.8 MB in the beginning and 96.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-28 09:18:58,806 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.20 ms. Allocated memory is still 90.2 MB. Free memory is still 48.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 316.51 ms. Allocated memory is still 123.7 MB. Free memory was 93.3 MB in the beginning and 94.6 MB in the end (delta: -1.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.54 ms. Allocated memory is still 123.7 MB. Free memory was 94.6 MB in the beginning and 92.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.03 ms. Allocated memory is still 123.7 MB. Free memory was 92.6 MB in the beginning and 91.6 MB in the end (delta: 960.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 325.46 ms. Allocated memory is still 123.7 MB. Free memory was 91.4 MB in the beginning and 77.9 MB in the end (delta: 13.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 3836.36 ms. Allocated memory was 123.7 MB in the beginning and 148.9 MB in the end (delta: 25.2 MB). Free memory was 77.4 MB in the beginning and 101.8 MB in the end (delta: -24.4 MB). Peak memory consumption was 56.0 MB. Max. memory is 16.1 GB. * Witness Printer took 66.56 ms. Allocated memory is still 148.9 MB. Free memory was 101.8 MB in the beginning and 96.6 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 3.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 883 SDtfs, 1267 SDslu, 709 SDs, 0 SdLazy, 900 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s 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.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 436 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 25 NumberOfFragments, 135 HoareAnnotationTreeSize, 4 FomulaSimplifications, 233224006 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 74415 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s 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-28 09:18:58,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b4cdac4-3474-4db3-930d-d67caee0474f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...