./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 57096758 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76ce038a982cf664fda20cc74bf529434a22cd4f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76ce038a982cf664fda20cc74bf529434a22cd4f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-5709675 [2021-10-16 02:57:01,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 02:57:01,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 02:57:01,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 02:57:01,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 02:57:01,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 02:57:01,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 02:57:01,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 02:57:01,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 02:57:01,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 02:57:01,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 02:57:01,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 02:57:01,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 02:57:01,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 02:57:01,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 02:57:01,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 02:57:01,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 02:57:01,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 02:57:01,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 02:57:01,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 02:57:01,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 02:57:01,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 02:57:01,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 02:57:01,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 02:57:01,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 02:57:01,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 02:57:01,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 02:57:01,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 02:57:01,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 02:57:01,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 02:57:01,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 02:57:01,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 02:57:01,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 02:57:01,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 02:57:01,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 02:57:01,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 02:57:01,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 02:57:01,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 02:57:01,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 02:57:01,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 02:57:01,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 02:57:01,396 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-16 02:57:01,427 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 02:57:01,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 02:57:01,429 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 02:57:01,429 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 02:57:01,429 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 02:57:01,429 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 02:57:01,430 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-16 02:57:01,430 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 02:57:01,430 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 02:57:01,430 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-16 02:57:01,431 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-16 02:57:01,431 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 02:57:01,431 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-16 02:57:01,431 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-16 02:57:01,432 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-16 02:57:01,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 02:57:01,433 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 02:57:01,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-16 02:57:01,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 02:57:01,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 02:57:01,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-16 02:57:01,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 02:57:01,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-16 02:57:01,434 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 02:57:01,435 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 02:57:01,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-16 02:57:01,435 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 02:57:01,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-16 02:57:01,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 02:57:01,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 02:57:01,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:57:01,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 02:57:01,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 02:57:01,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-16 02:57:01,437 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-16 02:57:01,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-16 02:57:01,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-16 02:57:01,438 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 02:57:01,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 02:57:01,439 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/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_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs 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 -> Taipan 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 -> 76ce038a982cf664fda20cc74bf529434a22cd4f [2021-10-16 02:57:01,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 02:57:01,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 02:57:01,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 02:57:01,736 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 02:57:01,737 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 02:57:01,739 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c [2021-10-16 02:57:01,844 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/data/0b9c98fa7/6dbdd259665944c6b84259e88683a777/FLAG112877633 [2021-10-16 02:57:02,580 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 02:57:02,587 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/sv-benchmarks/c/eca-rers2012/Problem01_label47.c [2021-10-16 02:57:02,606 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/data/0b9c98fa7/6dbdd259665944c6b84259e88683a777/FLAG112877633 [2021-10-16 02:57:02,784 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/data/0b9c98fa7/6dbdd259665944c6b84259e88683a777 [2021-10-16 02:57:02,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 02:57:02,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 02:57:02,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 02:57:02,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 02:57:02,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 02:57:02,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:57:02" (1/1) ... [2021-10-16 02:57:02,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1054ed7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:02, skipping insertion in model container [2021-10-16 02:57:02,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:57:02" (1/1) ... [2021-10-16 02:57:02,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 02:57:02,867 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 02:57:03,317 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_f095406b-6fd4-4389-8922-894d032545a4/sv-benchmarks/c/eca-rers2012/Problem01_label47.c[14627,14640] [2021-10-16 02:57:03,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:57:03,400 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 02:57:03,511 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_f095406b-6fd4-4389-8922-894d032545a4/sv-benchmarks/c/eca-rers2012/Problem01_label47.c[14627,14640] [2021-10-16 02:57:03,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:57:03,565 INFO L208 MainTranslator]: Completed translation [2021-10-16 02:57:03,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:03 WrapperNode [2021-10-16 02:57:03,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 02:57:03,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 02:57:03,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 02:57:03,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 02:57:03,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:03" (1/1) ... [2021-10-16 02:57:03,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:03" (1/1) ... [2021-10-16 02:57:03,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 02:57:03,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 02:57:03,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 02:57:03,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 02:57:03,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:03" (1/1) ... [2021-10-16 02:57:03,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:03" (1/1) ... [2021-10-16 02:57:03,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:03" (1/1) ... [2021-10-16 02:57:03,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:03" (1/1) ... [2021-10-16 02:57:03,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:03" (1/1) ... [2021-10-16 02:57:03,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:03" (1/1) ... [2021-10-16 02:57:03,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:03" (1/1) ... [2021-10-16 02:57:03,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 02:57:03,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 02:57:03,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 02:57:03,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 02:57:03,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:03" (1/1) ... [2021-10-16 02:57:03,800 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:57:03,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:57:03,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 02:57:03,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 02:57:03,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-16 02:57:03,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 02:57:03,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 02:57:03,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 02:57:05,776 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 02:57:05,776 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-16 02:57:05,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:57:05 BoogieIcfgContainer [2021-10-16 02:57:05,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 02:57:05,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 02:57:05,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 02:57:05,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 02:57:05,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:57:02" (1/3) ... [2021-10-16 02:57:05,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a525313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:57:05, skipping insertion in model container [2021-10-16 02:57:05,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:03" (2/3) ... [2021-10-16 02:57:05,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a525313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:57:05, skipping insertion in model container [2021-10-16 02:57:05,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:57:05" (3/3) ... [2021-10-16 02:57:05,789 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label47.c [2021-10-16 02:57:05,795 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 02:57:05,796 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-16 02:57:05,887 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 02:57:05,894 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-16 02:57:05,895 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-16 02:57:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 74 states have (on average 1.945945945945946) internal successors, (144), 75 states have internal predecessors, (144), 0 states have call successors, (0), 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-16 02:57:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-16 02:57:05,922 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:05,923 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:05,924 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:05,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:05,937 INFO L82 PathProgramCache]: Analyzing trace with hash 378907415, now seen corresponding path program 1 times [2021-10-16 02:57:05,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:05,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571193175] [2021-10-16 02:57:05,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:05,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:06,395 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-16 02:57:06,396 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:06,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571193175] [2021-10-16 02:57:06,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571193175] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:06,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:06,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:57:06,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680200539] [2021-10-16 02:57:06,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:57:06,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:06,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:57:06,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:06,428 INFO L87 Difference]: Start difference. First operand has 76 states, 74 states have (on average 1.945945945945946) internal successors, (144), 75 states have internal predecessors, (144), 0 states have call successors, (0), 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 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:06,931 INFO L93 Difference]: Finished difference Result 224 states and 428 transitions. [2021-10-16 02:57:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:57:06,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-10-16 02:57:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:06,946 INFO L225 Difference]: With dead ends: 224 [2021-10-16 02:57:06,947 INFO L226 Difference]: Without dead ends: 145 [2021-10-16 02:57:06,950 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-10-16 02:57:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-10-16 02:57:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.8402777777777777) internal successors, (265), 144 states have internal predecessors, (265), 0 states have call successors, (0), 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-16 02:57:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 265 transitions. [2021-10-16 02:57:07,018 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 265 transitions. Word has length 71 [2021-10-16 02:57:07,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:07,019 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 265 transitions. [2021-10-16 02:57:07,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:07,020 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 265 transitions. [2021-10-16 02:57:07,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-10-16 02:57:07,023 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:07,024 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:07,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-16 02:57:07,024 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:07,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:07,026 INFO L82 PathProgramCache]: Analyzing trace with hash -615454294, now seen corresponding path program 1 times [2021-10-16 02:57:07,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:07,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270566478] [2021-10-16 02:57:07,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:07,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:07,082 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:07,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270566478] [2021-10-16 02:57:07,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270566478] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:07,083 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:07,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:57:07,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128042985] [2021-10-16 02:57:07,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:57:07,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:07,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:57:07,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:07,086 INFO L87 Difference]: Start difference. First operand 145 states and 265 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:07,459 INFO L93 Difference]: Finished difference Result 431 states and 792 transitions. [2021-10-16 02:57:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:57:07,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-10-16 02:57:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:07,466 INFO L225 Difference]: With dead ends: 431 [2021-10-16 02:57:07,467 INFO L226 Difference]: Without dead ends: 287 [2021-10-16 02:57:07,469 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-10-16 02:57:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2021-10-16 02:57:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.6993006993006994) internal successors, (486), 286 states have internal predecessors, (486), 0 states have call successors, (0), 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-16 02:57:07,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 486 transitions. [2021-10-16 02:57:07,504 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 486 transitions. Word has length 77 [2021-10-16 02:57:07,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:07,505 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 486 transitions. [2021-10-16 02:57:07,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 486 transitions. [2021-10-16 02:57:07,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-16 02:57:07,529 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:07,529 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:07,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-16 02:57:07,532 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:07,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:07,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1583771894, now seen corresponding path program 1 times [2021-10-16 02:57:07,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:07,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72583552] [2021-10-16 02:57:07,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:07,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:07,677 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:07,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72583552] [2021-10-16 02:57:07,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72583552] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:07,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:07,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:57:07,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337473515] [2021-10-16 02:57:07,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:57:07,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:07,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:57:07,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:07,695 INFO L87 Difference]: Start difference. First operand 287 states and 486 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:08,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:08,069 INFO L93 Difference]: Finished difference Result 857 states and 1455 transitions. [2021-10-16 02:57:08,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:57:08,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-10-16 02:57:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:08,075 INFO L225 Difference]: With dead ends: 857 [2021-10-16 02:57:08,075 INFO L226 Difference]: Without dead ends: 571 [2021-10-16 02:57:08,077 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-10-16 02:57:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 358. [2021-10-16 02:57:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.6274509803921569) internal successors, (581), 357 states have internal predecessors, (581), 0 states have call successors, (0), 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-16 02:57:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 581 transitions. [2021-10-16 02:57:08,117 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 581 transitions. Word has length 78 [2021-10-16 02:57:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:08,118 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 581 transitions. [2021-10-16 02:57:08,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 581 transitions. [2021-10-16 02:57:08,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-16 02:57:08,120 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:08,120 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:08,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-16 02:57:08,120 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:08,121 INFO L82 PathProgramCache]: Analyzing trace with hash 802889221, now seen corresponding path program 1 times [2021-10-16 02:57:08,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:08,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284567471] [2021-10-16 02:57:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:08,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:08,212 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:08,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284567471] [2021-10-16 02:57:08,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284567471] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:08,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:08,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:57:08,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485346865] [2021-10-16 02:57:08,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:57:08,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:08,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:57:08,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:08,218 INFO L87 Difference]: Start difference. First operand 358 states and 581 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:08,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:08,553 INFO L93 Difference]: Finished difference Result 786 states and 1256 transitions. [2021-10-16 02:57:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:57:08,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-10-16 02:57:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:08,556 INFO L225 Difference]: With dead ends: 786 [2021-10-16 02:57:08,556 INFO L226 Difference]: Without dead ends: 358 [2021-10-16 02:57:08,558 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-10-16 02:57:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2021-10-16 02:57:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.350140056022409) internal successors, (482), 357 states have internal predecessors, (482), 0 states have call successors, (0), 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-16 02:57:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 482 transitions. [2021-10-16 02:57:08,574 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 482 transitions. Word has length 79 [2021-10-16 02:57:08,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:08,574 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 482 transitions. [2021-10-16 02:57:08,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:08,575 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 482 transitions. [2021-10-16 02:57:08,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-16 02:57:08,576 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:08,576 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:08,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-16 02:57:08,577 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:08,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:08,578 INFO L82 PathProgramCache]: Analyzing trace with hash 713022525, now seen corresponding path program 1 times [2021-10-16 02:57:08,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:08,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058117059] [2021-10-16 02:57:08,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:08,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-16 02:57:08,638 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:08,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058117059] [2021-10-16 02:57:08,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058117059] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:08,638 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:08,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:57:08,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955524716] [2021-10-16 02:57:08,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:57:08,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:08,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:57:08,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:08,640 INFO L87 Difference]: Start difference. First operand 358 states and 482 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 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-16 02:57:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:08,971 INFO L93 Difference]: Finished difference Result 999 states and 1349 transitions. [2021-10-16 02:57:08,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:57:08,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 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) Word has length 83 [2021-10-16 02:57:08,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:08,976 INFO L225 Difference]: With dead ends: 999 [2021-10-16 02:57:08,976 INFO L226 Difference]: Without dead ends: 642 [2021-10-16 02:57:08,977 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:08,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2021-10-16 02:57:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 571. [2021-10-16 02:57:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 570 states have (on average 1.2771929824561403) internal successors, (728), 570 states have internal predecessors, (728), 0 states have call successors, (0), 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-16 02:57:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 728 transitions. [2021-10-16 02:57:09,003 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 728 transitions. Word has length 83 [2021-10-16 02:57:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:09,004 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 728 transitions. [2021-10-16 02:57:09,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 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-16 02:57:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 728 transitions. [2021-10-16 02:57:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-16 02:57:09,007 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:09,008 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:09,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-16 02:57:09,008 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:09,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:09,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1234133893, now seen corresponding path program 1 times [2021-10-16 02:57:09,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:09,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056667779] [2021-10-16 02:57:09,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:09,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-16 02:57:09,101 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:09,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056667779] [2021-10-16 02:57:09,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056667779] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:09,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:09,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:57:09,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454404297] [2021-10-16 02:57:09,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:57:09,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:09,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:57:09,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:09,109 INFO L87 Difference]: Start difference. First operand 571 states and 728 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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-16 02:57:09,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:09,404 INFO L93 Difference]: Finished difference Result 1425 states and 1821 transitions. [2021-10-16 02:57:09,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:57:09,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 92 [2021-10-16 02:57:09,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:09,410 INFO L225 Difference]: With dead ends: 1425 [2021-10-16 02:57:09,410 INFO L226 Difference]: Without dead ends: 855 [2021-10-16 02:57:09,411 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:09,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2021-10-16 02:57:09,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 713. [2021-10-16 02:57:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 712 states have (on average 1.2893258426966292) internal successors, (918), 712 states have internal predecessors, (918), 0 states have call successors, (0), 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-16 02:57:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 918 transitions. [2021-10-16 02:57:09,435 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 918 transitions. Word has length 92 [2021-10-16 02:57:09,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:09,436 INFO L470 AbstractCegarLoop]: Abstraction has 713 states and 918 transitions. [2021-10-16 02:57:09,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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-16 02:57:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 918 transitions. [2021-10-16 02:57:09,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-16 02:57:09,438 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:09,439 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:09,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-16 02:57:09,439 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:09,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:09,440 INFO L82 PathProgramCache]: Analyzing trace with hash 692539411, now seen corresponding path program 1 times [2021-10-16 02:57:09,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:09,440 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112672843] [2021-10-16 02:57:09,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:09,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:09,495 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:09,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112672843] [2021-10-16 02:57:09,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112672843] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:09,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:09,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:57:09,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425840818] [2021-10-16 02:57:09,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:57:09,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:09,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:57:09,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:09,497 INFO L87 Difference]: Start difference. First operand 713 states and 918 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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-16 02:57:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:09,768 INFO L93 Difference]: Finished difference Result 1567 states and 2007 transitions. [2021-10-16 02:57:09,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:57:09,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2021-10-16 02:57:09,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:09,774 INFO L225 Difference]: With dead ends: 1567 [2021-10-16 02:57:09,774 INFO L226 Difference]: Without dead ends: 855 [2021-10-16 02:57:09,775 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:09,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2021-10-16 02:57:09,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2021-10-16 02:57:09,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 854 states have (on average 1.259953161592506) internal successors, (1076), 854 states have internal predecessors, (1076), 0 states have call successors, (0), 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-16 02:57:09,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1076 transitions. [2021-10-16 02:57:09,803 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1076 transitions. Word has length 100 [2021-10-16 02:57:09,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:09,804 INFO L470 AbstractCegarLoop]: Abstraction has 855 states and 1076 transitions. [2021-10-16 02:57:09,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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-16 02:57:09,804 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1076 transitions. [2021-10-16 02:57:09,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-16 02:57:09,807 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:09,807 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:09,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-16 02:57:09,808 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:09,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:09,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1427757861, now seen corresponding path program 1 times [2021-10-16 02:57:09,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:09,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495662239] [2021-10-16 02:57:09,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:09,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:09,895 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:09,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495662239] [2021-10-16 02:57:09,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495662239] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:09,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:09,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:57:09,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366063658] [2021-10-16 02:57:09,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:57:09,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:09,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:57:09,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:09,898 INFO L87 Difference]: Start difference. First operand 855 states and 1076 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-16 02:57:10,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:10,318 INFO L93 Difference]: Finished difference Result 1851 states and 2333 transitions. [2021-10-16 02:57:10,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:57:10,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2021-10-16 02:57:10,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:10,325 INFO L225 Difference]: With dead ends: 1851 [2021-10-16 02:57:10,325 INFO L226 Difference]: Without dead ends: 997 [2021-10-16 02:57:10,328 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:10,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2021-10-16 02:57:10,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 926. [2021-10-16 02:57:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 925 states have (on average 1.2443243243243243) internal successors, (1151), 925 states have internal predecessors, (1151), 0 states have call successors, (0), 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-16 02:57:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1151 transitions. [2021-10-16 02:57:10,358 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1151 transitions. Word has length 104 [2021-10-16 02:57:10,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:10,359 INFO L470 AbstractCegarLoop]: Abstraction has 926 states and 1151 transitions. [2021-10-16 02:57:10,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-16 02:57:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1151 transitions. [2021-10-16 02:57:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-10-16 02:57:10,363 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:10,364 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:10,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-16 02:57:10,364 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:10,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:10,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1726355692, now seen corresponding path program 1 times [2021-10-16 02:57:10,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:10,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321825094] [2021-10-16 02:57:10,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:10,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-16 02:57:10,499 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:10,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321825094] [2021-10-16 02:57:10,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321825094] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:10,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:10,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:57:10,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361683007] [2021-10-16 02:57:10,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:57:10,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:10,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:57:10,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:10,504 INFO L87 Difference]: Start difference. First operand 926 states and 1151 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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-16 02:57:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:10,963 INFO L93 Difference]: Finished difference Result 2064 states and 2547 transitions. [2021-10-16 02:57:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:57:10,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 129 [2021-10-16 02:57:10,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:10,971 INFO L225 Difference]: With dead ends: 2064 [2021-10-16 02:57:10,971 INFO L226 Difference]: Without dead ends: 1068 [2021-10-16 02:57:10,973 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:10,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2021-10-16 02:57:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 926. [2021-10-16 02:57:10,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 925 states have (on average 1.1643243243243244) internal successors, (1077), 925 states have internal predecessors, (1077), 0 states have call successors, (0), 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-16 02:57:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1077 transitions. [2021-10-16 02:57:11,003 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1077 transitions. Word has length 129 [2021-10-16 02:57:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:11,004 INFO L470 AbstractCegarLoop]: Abstraction has 926 states and 1077 transitions. [2021-10-16 02:57:11,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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-16 02:57:11,005 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1077 transitions. [2021-10-16 02:57:11,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-10-16 02:57:11,007 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:11,008 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:11,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-16 02:57:11,008 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:11,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1435599864, now seen corresponding path program 1 times [2021-10-16 02:57:11,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:11,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431683292] [2021-10-16 02:57:11,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:11,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:11,111 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:11,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431683292] [2021-10-16 02:57:11,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431683292] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:11,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:11,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:57:11,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183930765] [2021-10-16 02:57:11,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:57:11,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:11,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:57:11,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:11,115 INFO L87 Difference]: Start difference. First operand 926 states and 1077 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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-16 02:57:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:11,370 INFO L93 Difference]: Finished difference Result 1922 states and 2243 transitions. [2021-10-16 02:57:11,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:57:11,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2021-10-16 02:57:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:11,377 INFO L225 Difference]: With dead ends: 1922 [2021-10-16 02:57:11,378 INFO L226 Difference]: Without dead ends: 997 [2021-10-16 02:57:11,379 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2021-10-16 02:57:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2021-10-16 02:57:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 996 states have (on average 1.1365461847389557) internal successors, (1132), 996 states have internal predecessors, (1132), 0 states have call successors, (0), 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-16 02:57:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1132 transitions. [2021-10-16 02:57:11,413 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1132 transitions. Word has length 130 [2021-10-16 02:57:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:11,414 INFO L470 AbstractCegarLoop]: Abstraction has 997 states and 1132 transitions. [2021-10-16 02:57:11,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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-16 02:57:11,414 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1132 transitions. [2021-10-16 02:57:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-10-16 02:57:11,417 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:11,417 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:11,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-16 02:57:11,418 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:11,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:11,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1798879017, now seen corresponding path program 1 times [2021-10-16 02:57:11,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:11,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761890748] [2021-10-16 02:57:11,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:11,420 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-16 02:57:11,520 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:11,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761890748] [2021-10-16 02:57:11,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761890748] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:11,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:11,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:57:11,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810990946] [2021-10-16 02:57:11,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:57:11,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:11,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:57:11,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:11,524 INFO L87 Difference]: Start difference. First operand 997 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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-16 02:57:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:11,792 INFO L93 Difference]: Finished difference Result 1993 states and 2263 transitions. [2021-10-16 02:57:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:57:11,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 143 [2021-10-16 02:57:11,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:11,797 INFO L225 Difference]: With dead ends: 1993 [2021-10-16 02:57:11,797 INFO L226 Difference]: Without dead ends: 642 [2021-10-16 02:57:11,799 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:11,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2021-10-16 02:57:11,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2021-10-16 02:57:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 1.0811232449297972) internal successors, (693), 641 states have internal predecessors, (693), 0 states have call successors, (0), 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-16 02:57:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 693 transitions. [2021-10-16 02:57:11,824 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 693 transitions. Word has length 143 [2021-10-16 02:57:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:11,825 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 693 transitions. [2021-10-16 02:57:11,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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-16 02:57:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 693 transitions. [2021-10-16 02:57:11,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-10-16 02:57:11,829 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:11,829 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:11,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-16 02:57:11,855 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:11,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:11,855 INFO L82 PathProgramCache]: Analyzing trace with hash -573121035, now seen corresponding path program 1 times [2021-10-16 02:57:11,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:11,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486021457] [2021-10-16 02:57:11,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:11,856 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-10-16 02:57:11,982 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:11,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486021457] [2021-10-16 02:57:11,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486021457] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:11,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:11,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:57:11,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232280210] [2021-10-16 02:57:11,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:57:11,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:11,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:57:11,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:11,989 INFO L87 Difference]: Start difference. First operand 642 states and 693 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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-16 02:57:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:12,188 INFO L93 Difference]: Finished difference Result 1496 states and 1602 transitions. [2021-10-16 02:57:12,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:57:12,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 194 [2021-10-16 02:57:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:12,193 INFO L225 Difference]: With dead ends: 1496 [2021-10-16 02:57:12,193 INFO L226 Difference]: Without dead ends: 642 [2021-10-16 02:57:12,194 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2021-10-16 02:57:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2021-10-16 02:57:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 1.0655226209048363) internal successors, (683), 641 states have internal predecessors, (683), 0 states have call successors, (0), 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-16 02:57:12,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 683 transitions. [2021-10-16 02:57:12,215 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 683 transitions. Word has length 194 [2021-10-16 02:57:12,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:12,216 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 683 transitions. [2021-10-16 02:57:12,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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-16 02:57:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 683 transitions. [2021-10-16 02:57:12,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-10-16 02:57:12,220 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:12,220 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:12,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-16 02:57:12,221 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:12,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:12,221 INFO L82 PathProgramCache]: Analyzing trace with hash -357705682, now seen corresponding path program 1 times [2021-10-16 02:57:12,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:12,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118616680] [2021-10-16 02:57:12,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:12,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 246 proven. 84 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-16 02:57:12,442 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:12,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118616680] [2021-10-16 02:57:12,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118616680] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-16 02:57:12,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355384114] [2021-10-16 02:57:12,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:12,443 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:57:12,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:57:12,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:57:12,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-16 02:57:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:12,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-16 02:57:12,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:57:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 216 proven. 48 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-10-16 02:57:13,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:57:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 216 proven. 48 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-10-16 02:57:14,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355384114] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 02:57:14,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1514134099] [2021-10-16 02:57:14,989 INFO L159 IcfgInterpreter]: Started Sifa with 73 locations of interest [2021-10-16 02:57:14,989 INFO L166 IcfgInterpreter]: Building call graph [2021-10-16 02:57:14,996 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-16 02:57:15,002 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-16 02:57:15,002 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-16 02:57:15,260 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:57:15,270 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-16 02:57:15,271 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:57:15,272 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-10-16 02:57:15,273 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-16 02:57:15,274 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:57:15,275 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-16 02:57:15,282 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 179 [2021-10-16 02:57:15,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:57:15,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:57:15,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:57:15,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-10-16 02:57:15,337 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:57:15,338 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-16 02:57:15,338 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:57:15,339 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-16 02:57:15,339 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-16 02:57:15,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:57:15,383 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:57:15,387 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:57:15,396 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 179 [2021-10-16 02:57:15,397 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-16 02:57:15,397 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:176, output treesize:179 [2021-10-16 02:57:15,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-16 02:57:15,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-16 02:57:15,612 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: No corresponding IProgramVar for |v_#valid_10| at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.constructTermVarsProc(BasicPredicateFactory.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:81) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.predicate(SymbolicTools.java:174) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-16 02:57:15,616 INFO L168 Benchmark]: Toolchain (without parser) took 12825.58 ms. Allocated memory was 96.5 MB in the beginning and 234.9 MB in the end (delta: 138.4 MB). Free memory was 60.8 MB in the beginning and 192.9 MB in the end (delta: -132.1 MB). Peak memory consumption was 107.9 MB. Max. memory is 16.1 GB. [2021-10-16 02:57:15,617 INFO L168 Benchmark]: CDTParser took 1.03 ms. Allocated memory is still 96.5 MB. Free memory was 49.4 MB in the beginning and 49.4 MB in the end (delta: 50.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:57:15,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.91 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 60.6 MB in the beginning and 75.7 MB in the end (delta: -15.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-16 02:57:15,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.40 ms. Allocated memory is still 117.4 MB. Free memory was 75.7 MB in the beginning and 70.1 MB in the end (delta: 5.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-16 02:57:15,618 INFO L168 Benchmark]: Boogie Preprocessor took 118.24 ms. Allocated memory is still 117.4 MB. Free memory was 70.1 MB in the beginning and 65.6 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-16 02:57:15,619 INFO L168 Benchmark]: RCFGBuilder took 1991.02 ms. Allocated memory is still 117.4 MB. Free memory was 65.6 MB in the beginning and 41.4 MB in the end (delta: 24.2 MB). Peak memory consumption was 30.6 MB. Max. memory is 16.1 GB. [2021-10-16 02:57:15,619 INFO L168 Benchmark]: TraceAbstraction took 9833.58 ms. Allocated memory was 117.4 MB in the beginning and 234.9 MB in the end (delta: 117.4 MB). Free memory was 40.5 MB in the beginning and 192.9 MB in the end (delta: -152.4 MB). Peak memory consumption was 67.4 MB. Max. memory is 16.1 GB. [2021-10-16 02:57:15,622 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.03 ms. Allocated memory is still 96.5 MB. Free memory was 49.4 MB in the beginning and 49.4 MB in the end (delta: 50.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 773.91 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 60.6 MB in the beginning and 75.7 MB in the end (delta: -15.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 101.40 ms. Allocated memory is still 117.4 MB. Free memory was 75.7 MB in the beginning and 70.1 MB in the end (delta: 5.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 118.24 ms. Allocated memory is still 117.4 MB. Free memory was 70.1 MB in the beginning and 65.6 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1991.02 ms. Allocated memory is still 117.4 MB. Free memory was 65.6 MB in the beginning and 41.4 MB in the end (delta: 24.2 MB). Peak memory consumption was 30.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9833.58 ms. Allocated memory was 117.4 MB in the beginning and 234.9 MB in the end (delta: 117.4 MB). Free memory was 40.5 MB in the beginning and 192.9 MB in the end (delta: -152.4 MB). Peak memory consumption was 67.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: No corresponding IProgramVar for |v_#valid_10| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: No corresponding IProgramVar for |v_#valid_10|: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-16 02:57:15,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-5709675 [2021-10-16 02:57:18,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 02:57:18,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 02:57:18,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 02:57:18,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 02:57:18,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 02:57:18,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 02:57:18,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 02:57:18,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 02:57:18,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 02:57:18,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 02:57:18,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 02:57:18,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 02:57:18,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 02:57:18,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 02:57:18,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 02:57:18,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 02:57:18,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 02:57:18,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 02:57:18,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 02:57:18,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 02:57:18,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 02:57:18,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 02:57:18,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 02:57:18,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 02:57:18,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 02:57:18,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 02:57:18,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 02:57:18,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 02:57:18,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 02:57:18,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 02:57:18,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 02:57:18,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 02:57:18,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 02:57:18,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 02:57:18,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 02:57:18,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 02:57:18,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 02:57:18,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 02:57:18,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 02:57:18,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 02:57:18,508 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-10-16 02:57:18,558 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 02:57:18,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 02:57:18,560 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 02:57:18,560 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 02:57:18,560 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 02:57:18,560 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 02:57:18,561 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 02:57:18,561 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 02:57:18,561 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 02:57:18,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 02:57:18,564 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 02:57:18,564 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 02:57:18,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 02:57:18,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-16 02:57:18,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 02:57:18,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-16 02:57:18,565 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 02:57:18,566 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-16 02:57:18,566 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-16 02:57:18,566 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 02:57:18,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-16 02:57:18,567 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 02:57:18,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-16 02:57:18,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 02:57:18,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-16 02:57:18,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 02:57:18,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:57:18,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 02:57:18,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 02:57:18,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-16 02:57:18,569 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-16 02:57:18,569 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-16 02:57:18,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-16 02:57:18,570 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 02:57:18,570 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 02:57:18,571 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/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_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs 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 -> Taipan 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 -> 76ce038a982cf664fda20cc74bf529434a22cd4f [2021-10-16 02:57:19,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 02:57:19,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 02:57:19,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 02:57:19,082 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 02:57:19,083 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 02:57:19,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c [2021-10-16 02:57:19,172 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/data/b2a7b18ca/44d0f43dc6974d12bf041306e29f6c93/FLAG2f27354b7 [2021-10-16 02:57:19,966 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 02:57:19,967 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/sv-benchmarks/c/eca-rers2012/Problem01_label47.c [2021-10-16 02:57:19,982 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/data/b2a7b18ca/44d0f43dc6974d12bf041306e29f6c93/FLAG2f27354b7 [2021-10-16 02:57:20,157 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/data/b2a7b18ca/44d0f43dc6974d12bf041306e29f6c93 [2021-10-16 02:57:20,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 02:57:20,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 02:57:20,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 02:57:20,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 02:57:20,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 02:57:20,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:57:20" (1/1) ... [2021-10-16 02:57:20,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67300756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:20, skipping insertion in model container [2021-10-16 02:57:20,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:57:20" (1/1) ... [2021-10-16 02:57:20,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 02:57:20,253 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 02:57:20,663 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_f095406b-6fd4-4389-8922-894d032545a4/sv-benchmarks/c/eca-rers2012/Problem01_label47.c[14627,14640] [2021-10-16 02:57:20,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:57:20,730 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 02:57:20,861 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_f095406b-6fd4-4389-8922-894d032545a4/sv-benchmarks/c/eca-rers2012/Problem01_label47.c[14627,14640] [2021-10-16 02:57:20,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:57:20,932 INFO L208 MainTranslator]: Completed translation [2021-10-16 02:57:20,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:20 WrapperNode [2021-10-16 02:57:20,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 02:57:20,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 02:57:20,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 02:57:20,935 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 02:57:20,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:20" (1/1) ... [2021-10-16 02:57:20,966 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:20" (1/1) ... [2021-10-16 02:57:21,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 02:57:21,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 02:57:21,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 02:57:21,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 02:57:21,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:20" (1/1) ... [2021-10-16 02:57:21,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:20" (1/1) ... [2021-10-16 02:57:21,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:20" (1/1) ... [2021-10-16 02:57:21,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:20" (1/1) ... [2021-10-16 02:57:21,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:20" (1/1) ... [2021-10-16 02:57:21,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:20" (1/1) ... [2021-10-16 02:57:21,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:20" (1/1) ... [2021-10-16 02:57:21,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 02:57:21,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 02:57:21,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 02:57:21,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 02:57:21,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:20" (1/1) ... [2021-10-16 02:57:21,160 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:57:21,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:57:21,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 02:57:21,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 02:57:21,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-16 02:57:21,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 02:57:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 02:57:21,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 02:57:22,594 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 02:57:22,595 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-16 02:57:22,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:57:22 BoogieIcfgContainer [2021-10-16 02:57:22,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 02:57:22,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 02:57:22,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 02:57:22,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 02:57:22,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:57:20" (1/3) ... [2021-10-16 02:57:22,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae15cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:57:22, skipping insertion in model container [2021-10-16 02:57:22,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:57:20" (2/3) ... [2021-10-16 02:57:22,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae15cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:57:22, skipping insertion in model container [2021-10-16 02:57:22,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:57:22" (3/3) ... [2021-10-16 02:57:22,609 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label47.c [2021-10-16 02:57:22,616 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 02:57:22,616 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-16 02:57:22,684 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 02:57:22,691 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-16 02:57:22,692 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-16 02:57:22,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 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-16 02:57:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-10-16 02:57:22,734 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:22,735 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:22,736 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:22,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:22,747 INFO L82 PathProgramCache]: Analyzing trace with hash 689922294, now seen corresponding path program 1 times [2021-10-16 02:57:22,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:57:22,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810310177] [2021-10-16 02:57:22,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:22,772 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:57:22,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:57:22,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:57:22,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-16 02:57:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:22,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-16 02:57:22,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:57:32,552 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-16 02:57:32,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:57:38,175 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-16 02:57:38,176 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:57:38,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810310177] [2021-10-16 02:57:38,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810310177] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:38,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:38,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2021-10-16 02:57:38,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210715471] [2021-10-16 02:57:38,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-16 02:57:38,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:57:38,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-16 02:57:38,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2021-10-16 02:57:38,204 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 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 17 states, 17 states have (on average 7.823529411764706) internal successors, (133), 16 states have internal predecessors, (133), 0 states have call successors, (0), 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-16 02:57:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:42,027 INFO L93 Difference]: Finished difference Result 857 states and 1560 transitions. [2021-10-16 02:57:42,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-16 02:57:42,030 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.823529411764706) internal successors, (133), 16 states have internal predecessors, (133), 0 states have call successors, (0), 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 73 [2021-10-16 02:57:42,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:42,048 INFO L225 Difference]: With dead ends: 857 [2021-10-16 02:57:42,049 INFO L226 Difference]: Without dead ends: 586 [2021-10-16 02:57:42,053 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 945.5ms TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2021-10-16 02:57:42,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-10-16 02:57:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2021-10-16 02:57:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 1.3333333333333333) internal successors, (780), 585 states have internal predecessors, (780), 0 states have call successors, (0), 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-16 02:57:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 780 transitions. [2021-10-16 02:57:42,136 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 780 transitions. Word has length 73 [2021-10-16 02:57:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:42,137 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 780 transitions. [2021-10-16 02:57:42,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.823529411764706) internal successors, (133), 16 states have internal predecessors, (133), 0 states have call successors, (0), 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-16 02:57:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 780 transitions. [2021-10-16 02:57:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-10-16 02:57:42,145 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:42,145 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:42,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-10-16 02:57:42,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:57:42,358 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:42,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:42,359 INFO L82 PathProgramCache]: Analyzing trace with hash -398426685, now seen corresponding path program 1 times [2021-10-16 02:57:42,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:57:42,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128875727] [2021-10-16 02:57:42,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:42,361 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:57:42,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:57:42,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:57:42,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-16 02:57:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:43,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:57:43,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:57:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:43,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:57:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:43,572 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:57:43,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128875727] [2021-10-16 02:57:43,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128875727] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:43,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:43,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:57:43,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068187211] [2021-10-16 02:57:43,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:57:43,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:57:43,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:57:43,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:43,577 INFO L87 Difference]: Start difference. First operand 586 states and 780 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 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-16 02:57:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:44,515 INFO L93 Difference]: Finished difference Result 1374 states and 1911 transitions. [2021-10-16 02:57:44,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:57:44,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 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 80 [2021-10-16 02:57:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:44,523 INFO L225 Difference]: With dead ends: 1374 [2021-10-16 02:57:44,523 INFO L226 Difference]: Without dead ends: 979 [2021-10-16 02:57:44,526 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2021-10-16 02:57:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 717. [2021-10-16 02:57:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 716 states have (on average 1.3058659217877095) internal successors, (935), 716 states have internal predecessors, (935), 0 states have call successors, (0), 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-16 02:57:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 935 transitions. [2021-10-16 02:57:44,574 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 935 transitions. Word has length 80 [2021-10-16 02:57:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:44,575 INFO L470 AbstractCegarLoop]: Abstraction has 717 states and 935 transitions. [2021-10-16 02:57:44,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 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-16 02:57:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 935 transitions. [2021-10-16 02:57:44,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-10-16 02:57:44,586 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:44,586 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:44,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-16 02:57:44,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:57:44,796 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:44,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1084610533, now seen corresponding path program 1 times [2021-10-16 02:57:44,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:57:44,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47765265] [2021-10-16 02:57:44,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:44,813 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:57:44,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:57:44,815 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:57:44,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-16 02:57:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:45,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 02:57:45,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:57:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:45,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:57:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:46,950 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:57:46,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47765265] [2021-10-16 02:57:46,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47765265] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:46,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:46,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:57:46,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202809848] [2021-10-16 02:57:46,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:57:46,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:57:46,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:57:46,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:46,974 INFO L87 Difference]: Start difference. First operand 717 states and 935 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 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-16 02:57:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:47,983 INFO L93 Difference]: Finished difference Result 2029 states and 2601 transitions. [2021-10-16 02:57:47,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:57:47,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 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 120 [2021-10-16 02:57:47,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:47,993 INFO L225 Difference]: With dead ends: 2029 [2021-10-16 02:57:47,994 INFO L226 Difference]: Without dead ends: 1372 [2021-10-16 02:57:47,997 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:47,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2021-10-16 02:57:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2021-10-16 02:57:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1371 states have (on average 1.1779722830051058) internal successors, (1615), 1371 states have internal predecessors, (1615), 0 states have call successors, (0), 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-16 02:57:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1615 transitions. [2021-10-16 02:57:48,051 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1615 transitions. Word has length 120 [2021-10-16 02:57:48,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:48,054 INFO L470 AbstractCegarLoop]: Abstraction has 1372 states and 1615 transitions. [2021-10-16 02:57:48,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 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-16 02:57:48,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1615 transitions. [2021-10-16 02:57:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-10-16 02:57:48,068 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:48,069 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:48,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-16 02:57:48,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:57:48,285 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:48,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:48,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1114035495, now seen corresponding path program 1 times [2021-10-16 02:57:48,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:57:48,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382562123] [2021-10-16 02:57:48,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:48,292 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:57:48,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:57:48,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:57:48,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-16 02:57:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:49,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 02:57:49,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:57:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-10-16 02:57:49,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:57:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-10-16 02:57:49,983 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:57:49,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382562123] [2021-10-16 02:57:49,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382562123] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:49,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:49,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:57:49,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537673103] [2021-10-16 02:57:49,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:57:49,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:57:49,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:57:49,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:49,987 INFO L87 Difference]: Start difference. First operand 1372 states and 1615 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 02:57:51,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:51,216 INFO L93 Difference]: Finished difference Result 3732 states and 4389 transitions. [2021-10-16 02:57:51,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:57:51,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 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 133 [2021-10-16 02:57:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:51,253 INFO L225 Difference]: With dead ends: 3732 [2021-10-16 02:57:51,253 INFO L226 Difference]: Without dead ends: 2158 [2021-10-16 02:57:51,256 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:51,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2021-10-16 02:57:51,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 1765. [2021-10-16 02:57:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1764 states have (on average 1.100907029478458) internal successors, (1942), 1764 states have internal predecessors, (1942), 0 states have call successors, (0), 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-16 02:57:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1942 transitions. [2021-10-16 02:57:51,311 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1942 transitions. Word has length 133 [2021-10-16 02:57:51,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:51,311 INFO L470 AbstractCegarLoop]: Abstraction has 1765 states and 1942 transitions. [2021-10-16 02:57:51,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 02:57:51,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1942 transitions. [2021-10-16 02:57:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-10-16 02:57:51,316 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:51,317 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:51,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-16 02:57:51,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:57:51,532 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:51,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:51,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1513869564, now seen corresponding path program 1 times [2021-10-16 02:57:51,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:57:51,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047035470] [2021-10-16 02:57:51,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:51,535 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:57:51,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:57:51,537 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:57:51,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-16 02:57:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:52,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 02:57:52,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:57:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-10-16 02:57:52,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:57:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-10-16 02:57:53,503 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:57:53,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047035470] [2021-10-16 02:57:53,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047035470] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:53,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:53,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 02:57:53,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826672137] [2021-10-16 02:57:53,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:57:53,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:57:53,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:57:53,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:53,505 INFO L87 Difference]: Start difference. First operand 1765 states and 1942 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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-16 02:57:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:54,482 INFO L93 Difference]: Finished difference Result 4125 states and 4542 transitions. [2021-10-16 02:57:54,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:57:54,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 142 [2021-10-16 02:57:54,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:54,496 INFO L225 Difference]: With dead ends: 4125 [2021-10-16 02:57:54,497 INFO L226 Difference]: Without dead ends: 2289 [2021-10-16 02:57:54,500 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:54,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2021-10-16 02:57:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 2158. [2021-10-16 02:57:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2158 states, 2157 states have (on average 1.0797403801576264) internal successors, (2329), 2157 states have internal predecessors, (2329), 0 states have call successors, (0), 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-16 02:57:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 2329 transitions. [2021-10-16 02:57:54,582 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 2329 transitions. Word has length 142 [2021-10-16 02:57:54,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:54,583 INFO L470 AbstractCegarLoop]: Abstraction has 2158 states and 2329 transitions. [2021-10-16 02:57:54,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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-16 02:57:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 2329 transitions. [2021-10-16 02:57:54,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-10-16 02:57:54,588 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:54,589 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:54,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-16 02:57:54,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:57:54,810 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:54,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:54,810 INFO L82 PathProgramCache]: Analyzing trace with hash -768252620, now seen corresponding path program 1 times [2021-10-16 02:57:54,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:57:54,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800511209] [2021-10-16 02:57:54,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:54,812 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:57:54,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:57:54,814 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:57:54,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-16 02:57:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:55,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 02:57:55,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:57:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-10-16 02:57:56,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:57:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 64 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-10-16 02:57:56,979 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:57:56,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800511209] [2021-10-16 02:57:56,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800511209] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-16 02:57:56,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-16 02:57:56,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2021-10-16 02:57:56,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839156928] [2021-10-16 02:57:56,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:57:56,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:57:56,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:57:56,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:57:56,982 INFO L87 Difference]: Start difference. First operand 2158 states and 2329 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:57,836 INFO L93 Difference]: Finished difference Result 4125 states and 4456 transitions. [2021-10-16 02:57:57,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:57:57,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2021-10-16 02:57:57,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:57,850 INFO L225 Difference]: With dead ends: 4125 [2021-10-16 02:57:57,850 INFO L226 Difference]: Without dead ends: 2289 [2021-10-16 02:57:57,853 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 19.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:57:57,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2021-10-16 02:57:57,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 2158. [2021-10-16 02:57:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2158 states, 2157 states have (on average 1.0700046360686137) internal successors, (2308), 2157 states have internal predecessors, (2308), 0 states have call successors, (0), 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-16 02:57:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 2308 transitions. [2021-10-16 02:57:57,912 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 2308 transitions. Word has length 146 [2021-10-16 02:57:57,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:57,913 INFO L470 AbstractCegarLoop]: Abstraction has 2158 states and 2308 transitions. [2021-10-16 02:57:57,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 2308 transitions. [2021-10-16 02:57:57,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-10-16 02:57:57,919 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:57,919 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:57,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-10-16 02:57:58,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:57:58,137 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:57:58,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:58,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1419582596, now seen corresponding path program 1 times [2021-10-16 02:57:58,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:57:58,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274804410] [2021-10-16 02:57:58,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:58,140 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:57:58,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:57:58,140 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:57:58,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-16 02:57:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:59,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:57:59,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:57:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-10-16 02:57:59,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:57:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-10-16 02:57:59,990 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:57:59,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274804410] [2021-10-16 02:57:59,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274804410] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:59,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:59,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 02:57:59,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354881131] [2021-10-16 02:57:59,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:57:59,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:57:59,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:57:59,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:59,992 INFO L87 Difference]: Start difference. First operand 2158 states and 2308 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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-16 02:58:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:58:00,824 INFO L93 Difference]: Finished difference Result 5435 states and 5844 transitions. [2021-10-16 02:58:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:58:00,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 179 [2021-10-16 02:58:00,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:58:00,842 INFO L225 Difference]: With dead ends: 5435 [2021-10-16 02:58:00,842 INFO L226 Difference]: Without dead ends: 3599 [2021-10-16 02:58:00,845 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:58:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2021-10-16 02:58:00,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 2158. [2021-10-16 02:58:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2158 states, 2157 states have (on average 1.0662957811775615) internal successors, (2300), 2157 states have internal predecessors, (2300), 0 states have call successors, (0), 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-16 02:58:00,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 2300 transitions. [2021-10-16 02:58:00,913 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 2300 transitions. Word has length 179 [2021-10-16 02:58:00,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:58:00,914 INFO L470 AbstractCegarLoop]: Abstraction has 2158 states and 2300 transitions. [2021-10-16 02:58:00,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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-16 02:58:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 2300 transitions. [2021-10-16 02:58:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-10-16 02:58:00,921 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:58:00,921 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:58:00,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-16 02:58:01,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:58:01,136 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:58:01,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:58:01,136 INFO L82 PathProgramCache]: Analyzing trace with hash 901875753, now seen corresponding path program 1 times [2021-10-16 02:58:01,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:58:01,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721365698] [2021-10-16 02:58:01,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:58:01,139 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:58:01,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:58:01,148 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:58:01,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-16 02:58:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:58:02,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 02:58:02,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:58:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-16 02:58:03,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:58:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 194 proven. 21 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-16 02:58:03,647 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:58:03,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721365698] [2021-10-16 02:58:03,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721365698] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-16 02:58:03,648 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-16 02:58:03,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2021-10-16 02:58:03,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240779172] [2021-10-16 02:58:03,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:58:03,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:58:03,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:58:03,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:58:03,650 INFO L87 Difference]: Start difference. First operand 2158 states and 2300 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-16 02:58:04,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:58:04,413 INFO L93 Difference]: Finished difference Result 4649 states and 4972 transitions. [2021-10-16 02:58:04,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:58:04,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 206 [2021-10-16 02:58:04,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:58:04,428 INFO L225 Difference]: With dead ends: 4649 [2021-10-16 02:58:04,429 INFO L226 Difference]: Without dead ends: 2682 [2021-10-16 02:58:04,433 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 19.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:58:04,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2021-10-16 02:58:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2027. [2021-10-16 02:58:04,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 2026 states have (on average 1.0552813425468903) internal successors, (2138), 2026 states have internal predecessors, (2138), 0 states have call successors, (0), 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-16 02:58:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2138 transitions. [2021-10-16 02:58:04,487 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2138 transitions. Word has length 206 [2021-10-16 02:58:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:58:04,487 INFO L470 AbstractCegarLoop]: Abstraction has 2027 states and 2138 transitions. [2021-10-16 02:58:04,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-16 02:58:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2138 transitions. [2021-10-16 02:58:04,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2021-10-16 02:58:04,495 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:58:04,495 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:58:04,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-16 02:58:04,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:58:04,713 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:58:04,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:58:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1923916221, now seen corresponding path program 1 times [2021-10-16 02:58:04,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:58:04,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269002906] [2021-10-16 02:58:04,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:58:04,715 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:58:04,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:58:04,717 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:58:04,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-16 02:58:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:58:05,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 02:58:05,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:58:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-10-16 02:58:06,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:58:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 266 proven. 21 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-10-16 02:58:07,387 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:58:07,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269002906] [2021-10-16 02:58:07,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269002906] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-16 02:58:07,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-16 02:58:07,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2021-10-16 02:58:07,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816524783] [2021-10-16 02:58:07,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:58:07,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:58:07,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:58:07,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:58:07,390 INFO L87 Difference]: Start difference. First operand 2027 states and 2138 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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-16 02:58:08,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:58:08,107 INFO L93 Difference]: Finished difference Result 3994 states and 4214 transitions. [2021-10-16 02:58:08,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:58:08,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 255 [2021-10-16 02:58:08,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:58:08,115 INFO L225 Difference]: With dead ends: 3994 [2021-10-16 02:58:08,115 INFO L226 Difference]: Without dead ends: 2289 [2021-10-16 02:58:08,117 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 20.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:58:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2021-10-16 02:58:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 2027. [2021-10-16 02:58:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 2026 states have (on average 1.0533070088845016) internal successors, (2134), 2026 states have internal predecessors, (2134), 0 states have call successors, (0), 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-16 02:58:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2134 transitions. [2021-10-16 02:58:08,168 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2134 transitions. Word has length 255 [2021-10-16 02:58:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:58:08,168 INFO L470 AbstractCegarLoop]: Abstraction has 2027 states and 2134 transitions. [2021-10-16 02:58:08,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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-16 02:58:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2134 transitions. [2021-10-16 02:58:08,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2021-10-16 02:58:08,176 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:58:08,177 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:58:08,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-16 02:58:08,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:58:08,414 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:58:08,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:58:08,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1178983701, now seen corresponding path program 1 times [2021-10-16 02:58:08,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:58:08,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458025420] [2021-10-16 02:58:08,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:58:08,417 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:58:08,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:58:08,417 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:58:08,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-16 02:58:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-16 02:58:09,778 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-16 02:58:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-16 02:58:10,212 INFO L133 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2021-10-16 02:58:10,212 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-16 02:58:10,214 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-16 02:58:10,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-10-16 02:58:10,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:58:10,439 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-16 02:58:10,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 02:58:10 BoogieIcfgContainer [2021-10-16 02:58:10,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-16 02:58:10,758 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-16 02:58:10,758 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-16 02:58:10,758 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-16 02:58:10,759 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:57:22" (3/4) ... [2021-10-16 02:58:10,761 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-16 02:58:11,018 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/witness.graphml [2021-10-16 02:58:11,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-16 02:58:11,020 INFO L168 Benchmark]: Toolchain (without parser) took 50849.20 ms. Allocated memory was 54.5 MB in the beginning and 207.6 MB in the end (delta: 153.1 MB). Free memory was 30.8 MB in the beginning and 87.5 MB in the end (delta: -56.7 MB). Peak memory consumption was 98.5 MB. Max. memory is 16.1 GB. [2021-10-16 02:58:11,020 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 54.5 MB. Free memory is still 36.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:58:11,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.21 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 30.6 MB in the beginning and 40.5 MB in the end (delta: -9.9 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. [2021-10-16 02:58:11,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.82 ms. Allocated memory is still 67.1 MB. Free memory was 40.5 MB in the beginning and 34.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-16 02:58:11,022 INFO L168 Benchmark]: Boogie Preprocessor took 120.50 ms. Allocated memory is still 67.1 MB. Free memory was 34.6 MB in the beginning and 44.2 MB in the end (delta: -9.6 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. [2021-10-16 02:58:11,022 INFO L168 Benchmark]: RCFGBuilder took 1451.97 ms. Allocated memory was 67.1 MB in the beginning and 94.4 MB in the end (delta: 27.3 MB). Free memory was 43.9 MB in the beginning and 62.6 MB in the end (delta: -18.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.1 GB. [2021-10-16 02:58:11,023 INFO L168 Benchmark]: TraceAbstraction took 48155.22 ms. Allocated memory was 94.4 MB in the beginning and 207.6 MB in the end (delta: 113.2 MB). Free memory was 61.7 MB in the beginning and 129.2 MB in the end (delta: -67.5 MB). Peak memory consumption was 139.8 MB. Max. memory is 16.1 GB. [2021-10-16 02:58:11,023 INFO L168 Benchmark]: Witness Printer took 260.52 ms. Allocated memory is still 207.6 MB. Free memory was 129.2 MB in the beginning and 87.5 MB in the end (delta: 41.7 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. [2021-10-16 02:58:11,026 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.30 ms. Allocated memory is still 54.5 MB. Free memory is still 36.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 762.21 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 30.6 MB in the beginning and 40.5 MB in the end (delta: -9.9 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 91.82 ms. Allocated memory is still 67.1 MB. Free memory was 40.5 MB in the beginning and 34.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 120.50 ms. Allocated memory is still 67.1 MB. Free memory was 34.6 MB in the beginning and 44.2 MB in the end (delta: -9.6 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1451.97 ms. Allocated memory was 67.1 MB in the beginning and 94.4 MB in the end (delta: 27.3 MB). Free memory was 43.9 MB in the beginning and 62.6 MB in the end (delta: -18.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 48155.22 ms. Allocated memory was 94.4 MB in the beginning and 207.6 MB in the end (delta: 113.2 MB). Free memory was 61.7 MB in the beginning and 129.2 MB in the end (delta: -67.5 MB). Peak memory consumption was 139.8 MB. Max. memory is 16.1 GB. * Witness Printer took 260.52 ms. Allocated memory is still 207.6 MB. Free memory was 129.2 MB in the beginning and 87.5 MB in the end (delta: 41.7 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 405]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L590] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L159] a16 = 4 [L160] a17 = 0 [L161] return 25; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND TRUE ((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1))) [L242] a8 = 14 [L243] a7 = 0 [L244] a17 = 1 [L245] a21 = 1 [L246] a16 = 4 [L247] return -1; VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L405] reach_error() VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47754.1ms, OverallIterations: 10, TraceHistogramMax: 7, EmptinessCheckTime: 85.3ms, AutomataDifference: 11342.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 22.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 382 SDtfs, 3168 SDslu, 143 SDs, 0 SdLazy, 6737 SolverSat, 1077 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8527.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2652 GetRequests, 2616 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1066.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2158occurred in iteration=5, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 534.9ms AutomataMinimizationTime, 9 MinimizatonAttempts, 3275 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 170.6ms SsaConstructionTime, 829.9ms SatisfiabilityAnalysisTime, 23495.7ms InterpolantComputationTime, 1598 NumberOfCodeBlocks, 1598 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2650 ConstructedInterpolants, 0 QuantifiedInterpolants, 17295 SizeOfPredicates, 25 NumberOfNonLiveVariables, 2058 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 2517/2562 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 RESULT: Ultimate proved your program to be incorrect! [2021-10-16 02:58:11,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f095406b-6fd4-4389-8922-894d032545a4/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...