./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7fbaed3b-ac56-4c11-8db1-517ac9d91f44/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7fbaed3b-ac56-4c11-8db1-517ac9d91f44/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7fbaed3b-ac56-4c11-8db1-517ac9d91f44/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7fbaed3b-ac56-4c11-8db1-517ac9d91f44/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label59.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7fbaed3b-ac56-4c11-8db1-517ac9d91f44/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7fbaed3b-ac56-4c11-8db1-517ac9d91f44/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c830b0c5c33990192c3ba87f57f72df9f3b5a041 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 21:07:28,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:07:28,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:07:28,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:07:28,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:07:28,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:07:28,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:07:28,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:07:28,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:07:28,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:07:28,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:07:28,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:07:28,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:07:28,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:07:28,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:07:28,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:07:28,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:07:28,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:07:28,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:07:28,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:07:28,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:07:28,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:07:28,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:07:28,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:07:28,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:07:28,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:07:28,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:07:28,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:07:28,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:07:28,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:07:28,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:07:28,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:07:28,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:07:28,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:07:28,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:07:28,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:07:28,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:07:28,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:07:28,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:07:28,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:07:28,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:07:28,682 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7fbaed3b-ac56-4c11-8db1-517ac9d91f44/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:07:28,692 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:07:28,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:07:28,693 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:07:28,693 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:07:28,693 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:07:28,693 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:07:28,693 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:07:28,693 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:07:28,694 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:07:28,694 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:07:28,694 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:07:28,694 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:07:28,694 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:07:28,694 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:07:28,694 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:07:28,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:07:28,695 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:07:28,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:07:28,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:07:28,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:07:28,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:07:28,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:07:28,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:07:28,696 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:07:28,696 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:07:28,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:07:28,696 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:07:28,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:07:28,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:07:28,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:07:28,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:07:28,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:07:28,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:07:28,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:07:28,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:07:28,697 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:07:28,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:07:28,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:07:28,697 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:07:28,697 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:07:28,698 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/run_dir_7fbaed3b-ac56-4c11-8db1-517ac9d91f44/bin/utaipan 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(__VERIFIER_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 -> c830b0c5c33990192c3ba87f57f72df9f3b5a041 [2019-12-07 21:07:28,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:07:28,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:07:28,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:07:28,811 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:07:28,811 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:07:28,812 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7fbaed3b-ac56-4c11-8db1-517ac9d91f44/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label59.c [2019-12-07 21:07:28,850 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7fbaed3b-ac56-4c11-8db1-517ac9d91f44/bin/utaipan/data/aa1c734fd/981f1e67e5ea496ebf85cc6284d53d6d/FLAGa1995bb1a [2019-12-07 21:07:29,246 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:07:29,247 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7fbaed3b-ac56-4c11-8db1-517ac9d91f44/sv-benchmarks/c/eca-rers2012/Problem01_label59.c [2019-12-07 21:07:29,255 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7fbaed3b-ac56-4c11-8db1-517ac9d91f44/bin/utaipan/data/aa1c734fd/981f1e67e5ea496ebf85cc6284d53d6d/FLAGa1995bb1a [2019-12-07 21:07:29,265 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7fbaed3b-ac56-4c11-8db1-517ac9d91f44/bin/utaipan/data/aa1c734fd/981f1e67e5ea496ebf85cc6284d53d6d [2019-12-07 21:07:29,267 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:07:29,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:07:29,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:07:29,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:07:29,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:07:29,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:07:29" (1/1) ... [2019-12-07 21:07:29,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:29, skipping insertion in model container [2019-12-07 21:07:29,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:07:29" (1/1) ... [2019-12-07 21:07:29,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:07:29,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:07:29,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:07:29,557 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:07:29,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:07:29,618 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:07:29,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:29 WrapperNode [2019-12-07 21:07:29,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:07:29,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:07:29,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:07:29,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:07:29,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:29" (1/1) ... [2019-12-07 21:07:29,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:29" (1/1) ... [2019-12-07 21:07:29,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:07:29,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:07:29,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:07:29,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:07:29,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:29" (1/1) ... [2019-12-07 21:07:29,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:29" (1/1) ... [2019-12-07 21:07:29,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:29" (1/1) ... [2019-12-07 21:07:29,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:29" (1/1) ... [2019-12-07 21:07:29,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:29" (1/1) ... [2019-12-07 21:07:29,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:29" (1/1) ... [2019-12-07 21:07:29,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:29" (1/1) ... [2019-12-07 21:07:29,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:07:29,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:07:29,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:07:29,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:07:29,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fbaed3b-ac56-4c11-8db1-517ac9d91f44/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:07:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:07:29,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:07:30,858 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:07:30,858 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 21:07:30,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:07:30 BoogieIcfgContainer [2019-12-07 21:07:30,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:07:30,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:07:30,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:07:30,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:07:30,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:07:29" (1/3) ... [2019-12-07 21:07:30,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f2d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:07:30, skipping insertion in model container [2019-12-07 21:07:30,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:29" (2/3) ... [2019-12-07 21:07:30,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f2d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:07:30, skipping insertion in model container [2019-12-07 21:07:30,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:07:30" (3/3) ... [2019-12-07 21:07:30,866 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label59.c [2019-12-07 21:07:30,874 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:07:30,879 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 21:07:30,887 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 21:07:30,906 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:07:30,906 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:07:30,906 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:07:30,906 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:07:30,906 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:07:30,907 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:07:30,907 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:07:30,907 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:07:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-12-07 21:07:30,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 21:07:30,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:30,926 INFO L410 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] [2019-12-07 21:07:30,926 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:30,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:30,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1323245343, now seen corresponding path program 1 times [2019-12-07 21:07:30,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:30,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157150483] [2019-12-07 21:07:30,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:07:31,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157150483] [2019-12-07 21:07:31,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:31,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:07:31,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528924625] [2019-12-07 21:07:31,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:07:31,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:31,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:07:31,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:07:31,225 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-12-07 21:07:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:31,609 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-12-07 21:07:31,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:07:31,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 21:07:31,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:31,619 INFO L225 Difference]: With dead ends: 297 [2019-12-07 21:07:31,620 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 21:07:31,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:07:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 21:07:31,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-12-07 21:07:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 21:07:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 372 transitions. [2019-12-07 21:07:31,658 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 372 transitions. Word has length 71 [2019-12-07 21:07:31,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:31,658 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 372 transitions. [2019-12-07 21:07:31,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:07:31,659 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 372 transitions. [2019-12-07 21:07:31,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 21:07:31,662 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:31,662 INFO L410 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] [2019-12-07 21:07:31,662 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:31,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:31,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2123302636, now seen corresponding path program 1 times [2019-12-07 21:07:31,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:31,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87798470] [2019-12-07 21:07:31,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:07:31,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87798470] [2019-12-07 21:07:31,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:31,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:07:31,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857500517] [2019-12-07 21:07:31,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:07:31,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:31,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:07:31,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:07:31,725 INFO L87 Difference]: Start difference. First operand 216 states and 372 transitions. Second operand 3 states. [2019-12-07 21:07:31,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:31,950 INFO L93 Difference]: Finished difference Result 644 states and 1113 transitions. [2019-12-07 21:07:31,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:07:31,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-12-07 21:07:31,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:31,954 INFO L225 Difference]: With dead ends: 644 [2019-12-07 21:07:31,954 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 21:07:31,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:07:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 21:07:31,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 358. [2019-12-07 21:07:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-12-07 21:07:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 550 transitions. [2019-12-07 21:07:31,972 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 550 transitions. Word has length 78 [2019-12-07 21:07:31,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:31,972 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 550 transitions. [2019-12-07 21:07:31,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:07:31,972 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 550 transitions. [2019-12-07 21:07:31,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 21:07:31,975 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:31,975 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-12-07 21:07:31,975 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:31,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:31,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1265514425, now seen corresponding path program 1 times [2019-12-07 21:07:31,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:31,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318005949] [2019-12-07 21:07:31,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 21:07:32,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318005949] [2019-12-07 21:07:32,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:32,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:07:32,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193102106] [2019-12-07 21:07:32,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:07:32,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:32,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:07:32,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:07:32,004 INFO L87 Difference]: Start difference. First operand 358 states and 550 transitions. Second operand 4 states. [2019-12-07 21:07:32,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:32,283 INFO L93 Difference]: Finished difference Result 1070 states and 1647 transitions. [2019-12-07 21:07:32,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:07:32,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 21:07:32,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:32,287 INFO L225 Difference]: With dead ends: 1070 [2019-12-07 21:07:32,287 INFO L226 Difference]: Without dead ends: 642 [2019-12-07 21:07:32,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:07:32,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-07 21:07:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-12-07 21:07:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-07 21:07:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 944 transitions. [2019-12-07 21:07:32,312 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 944 transitions. Word has length 84 [2019-12-07 21:07:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:32,312 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 944 transitions. [2019-12-07 21:07:32,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:07:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 944 transitions. [2019-12-07 21:07:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 21:07:32,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:32,314 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-12-07 21:07:32,315 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:32,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:32,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1088771838, now seen corresponding path program 1 times [2019-12-07 21:07:32,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:32,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277739777] [2019-12-07 21:07:32,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 21:07:32,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277739777] [2019-12-07 21:07:32,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:32,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:07:32,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921312913] [2019-12-07 21:07:32,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:07:32,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:32,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:07:32,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:07:32,358 INFO L87 Difference]: Start difference. First operand 642 states and 944 transitions. Second operand 3 states. [2019-12-07 21:07:32,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:32,601 INFO L93 Difference]: Finished difference Result 1638 states and 2440 transitions. [2019-12-07 21:07:32,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:07:32,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-07 21:07:32,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:32,606 INFO L225 Difference]: With dead ends: 1638 [2019-12-07 21:07:32,606 INFO L226 Difference]: Without dead ends: 926 [2019-12-07 21:07:32,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:07:32,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-12-07 21:07:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 784. [2019-12-07 21:07:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-12-07 21:07:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1000 transitions. [2019-12-07 21:07:32,629 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1000 transitions. Word has length 86 [2019-12-07 21:07:32,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:32,630 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1000 transitions. [2019-12-07 21:07:32,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:07:32,630 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1000 transitions. [2019-12-07 21:07:32,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 21:07:32,632 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:32,632 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:32,632 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:32,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:32,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1624306670, now seen corresponding path program 1 times [2019-12-07 21:07:32,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:32,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524239690] [2019-12-07 21:07:32,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 21:07:32,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524239690] [2019-12-07 21:07:32,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:32,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:07:32,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913859328] [2019-12-07 21:07:32,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:07:32,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:32,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:07:32,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:07:32,693 INFO L87 Difference]: Start difference. First operand 784 states and 1000 transitions. Second operand 4 states. [2019-12-07 21:07:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:32,936 INFO L93 Difference]: Finished difference Result 1661 states and 2104 transitions. [2019-12-07 21:07:32,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:07:32,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 21:07:32,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:32,940 INFO L225 Difference]: With dead ends: 1661 [2019-12-07 21:07:32,940 INFO L226 Difference]: Without dead ends: 878 [2019-12-07 21:07:32,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:07:32,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-12-07 21:07:32,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 855. [2019-12-07 21:07:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-12-07 21:07:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1074 transitions. [2019-12-07 21:07:32,956 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1074 transitions. Word has length 94 [2019-12-07 21:07:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:32,956 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1074 transitions. [2019-12-07 21:07:32,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:07:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1074 transitions. [2019-12-07 21:07:32,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 21:07:32,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:32,958 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:32,958 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:32,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:32,958 INFO L82 PathProgramCache]: Analyzing trace with hash -161616202, now seen corresponding path program 1 times [2019-12-07 21:07:32,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:32,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641951720] [2019-12-07 21:07:32,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:07:32,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641951720] [2019-12-07 21:07:32,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:32,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:07:32,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567818660] [2019-12-07 21:07:32,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:07:32,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:32,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:07:32,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:07:32,997 INFO L87 Difference]: Start difference. First operand 855 states and 1074 transitions. Second operand 4 states. [2019-12-07 21:07:33,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:33,303 INFO L93 Difference]: Finished difference Result 2064 states and 2638 transitions. [2019-12-07 21:07:33,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:07:33,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 21:07:33,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:33,308 INFO L225 Difference]: With dead ends: 2064 [2019-12-07 21:07:33,309 INFO L226 Difference]: Without dead ends: 1281 [2019-12-07 21:07:33,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:07:33,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-12-07 21:07:33,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 926. [2019-12-07 21:07:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 21:07:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1096 transitions. [2019-12-07 21:07:33,330 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1096 transitions. Word has length 98 [2019-12-07 21:07:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:33,330 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1096 transitions. [2019-12-07 21:07:33,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:07:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1096 transitions. [2019-12-07 21:07:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 21:07:33,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:33,332 INFO L410 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] [2019-12-07 21:07:33,333 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:33,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:33,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2113447653, now seen corresponding path program 1 times [2019-12-07 21:07:33,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:33,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601775180] [2019-12-07 21:07:33,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:07:33,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601775180] [2019-12-07 21:07:33,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:33,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:07:33,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515090864] [2019-12-07 21:07:33,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:07:33,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:33,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:07:33,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:07:33,458 INFO L87 Difference]: Start difference. First operand 926 states and 1096 transitions. Second operand 8 states. [2019-12-07 21:07:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:33,941 INFO L93 Difference]: Finished difference Result 2035 states and 2413 transitions. [2019-12-07 21:07:33,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:07:33,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-12-07 21:07:33,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:33,946 INFO L225 Difference]: With dead ends: 2035 [2019-12-07 21:07:33,946 INFO L226 Difference]: Without dead ends: 1181 [2019-12-07 21:07:33,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:07:33,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-12-07 21:07:33,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 997. [2019-12-07 21:07:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 21:07:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1168 transitions. [2019-12-07 21:07:33,964 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1168 transitions. Word has length 104 [2019-12-07 21:07:33,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:33,964 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1168 transitions. [2019-12-07 21:07:33,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:07:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1168 transitions. [2019-12-07 21:07:33,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 21:07:33,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:33,966 INFO L410 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] [2019-12-07 21:07:33,966 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:33,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:33,966 INFO L82 PathProgramCache]: Analyzing trace with hash 646845970, now seen corresponding path program 1 times [2019-12-07 21:07:33,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:33,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462210021] [2019-12-07 21:07:33,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:07:34,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462210021] [2019-12-07 21:07:34,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:34,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:07:34,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898901105] [2019-12-07 21:07:34,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:07:34,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:34,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:07:34,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:07:34,040 INFO L87 Difference]: Start difference. First operand 997 states and 1168 transitions. Second operand 4 states. [2019-12-07 21:07:34,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:34,279 INFO L93 Difference]: Finished difference Result 2064 states and 2433 transitions. [2019-12-07 21:07:34,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:07:34,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-12-07 21:07:34,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:34,285 INFO L225 Difference]: With dead ends: 2064 [2019-12-07 21:07:34,285 INFO L226 Difference]: Without dead ends: 1139 [2019-12-07 21:07:34,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:07:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-12-07 21:07:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2019-12-07 21:07:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-12-07 21:07:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1299 transitions. [2019-12-07 21:07:34,311 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1299 transitions. Word has length 130 [2019-12-07 21:07:34,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:34,312 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 1299 transitions. [2019-12-07 21:07:34,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:07:34,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1299 transitions. [2019-12-07 21:07:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 21:07:34,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:34,315 INFO L410 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] [2019-12-07 21:07:34,315 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:34,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:34,315 INFO L82 PathProgramCache]: Analyzing trace with hash -730919693, now seen corresponding path program 1 times [2019-12-07 21:07:34,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:34,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499671744] [2019-12-07 21:07:34,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:34,704 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:07:34,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499671744] [2019-12-07 21:07:34,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:34,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 21:07:34,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852796060] [2019-12-07 21:07:34,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 21:07:34,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:34,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 21:07:34,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:07:34,705 INFO L87 Difference]: Start difference. First operand 1139 states and 1299 transitions. Second operand 12 states. [2019-12-07 21:07:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:35,309 INFO L93 Difference]: Finished difference Result 2403 states and 2749 transitions. [2019-12-07 21:07:35,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 21:07:35,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2019-12-07 21:07:35,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:35,316 INFO L225 Difference]: With dead ends: 2403 [2019-12-07 21:07:35,316 INFO L226 Difference]: Without dead ends: 1319 [2019-12-07 21:07:35,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:07:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-12-07 21:07:35,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1174. [2019-12-07 21:07:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-12-07 21:07:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1337 transitions. [2019-12-07 21:07:35,338 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1337 transitions. Word has length 143 [2019-12-07 21:07:35,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:35,338 INFO L462 AbstractCegarLoop]: Abstraction has 1174 states and 1337 transitions. [2019-12-07 21:07:35,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 21:07:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1337 transitions. [2019-12-07 21:07:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 21:07:35,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:35,340 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:35,340 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:35,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:35,340 INFO L82 PathProgramCache]: Analyzing trace with hash -665613853, now seen corresponding path program 1 times [2019-12-07 21:07:35,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:35,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890864475] [2019-12-07 21:07:35,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:07:35,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890864475] [2019-12-07 21:07:35,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:35,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:07:35,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608399778] [2019-12-07 21:07:35,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:07:35,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:35,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:07:35,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:07:35,423 INFO L87 Difference]: Start difference. First operand 1174 states and 1337 transitions. Second operand 6 states. [2019-12-07 21:07:35,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:35,765 INFO L93 Difference]: Finished difference Result 2291 states and 2614 transitions. [2019-12-07 21:07:35,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:07:35,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-12-07 21:07:35,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:35,771 INFO L225 Difference]: With dead ends: 2291 [2019-12-07 21:07:35,771 INFO L226 Difference]: Without dead ends: 1189 [2019-12-07 21:07:35,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:07:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-12-07 21:07:35,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1174. [2019-12-07 21:07:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-12-07 21:07:35,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1312 transitions. [2019-12-07 21:07:35,800 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1312 transitions. Word has length 145 [2019-12-07 21:07:35,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:35,800 INFO L462 AbstractCegarLoop]: Abstraction has 1174 states and 1312 transitions. [2019-12-07 21:07:35,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:07:35,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1312 transitions. [2019-12-07 21:07:35,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-12-07 21:07:35,802 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:35,802 INFO L410 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] [2019-12-07 21:07:35,802 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:35,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:35,802 INFO L82 PathProgramCache]: Analyzing trace with hash 604338175, now seen corresponding path program 1 times [2019-12-07 21:07:35,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:35,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415329696] [2019-12-07 21:07:35,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 21:07:35,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415329696] [2019-12-07 21:07:35,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:35,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:07:35,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306834553] [2019-12-07 21:07:35,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:07:35,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:35,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:07:35,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:07:35,903 INFO L87 Difference]: Start difference. First operand 1174 states and 1312 transitions. Second operand 4 states. [2019-12-07 21:07:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:36,163 INFO L93 Difference]: Finished difference Result 2700 states and 3025 transitions. [2019-12-07 21:07:36,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:07:36,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-12-07 21:07:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:36,164 INFO L225 Difference]: With dead ends: 2700 [2019-12-07 21:07:36,164 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 21:07:36,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:07:36,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 21:07:36,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 21:07:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 21:07:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 21:07:36,167 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 194 [2019-12-07 21:07:36,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:36,167 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 21:07:36,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:07:36,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 21:07:36,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 21:07:36,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 21:07:36,563 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-12-07 21:07:36,809 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-12-07 21:07:36,811 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 21:07:36,811 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 21:07:36,811 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 21:07:36,811 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 21:07:36,812 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 21:07:36,812 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 21:07:36,812 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 21:07:36,812 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 21:07:36,812 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 21:07:36,812 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 21:07:36,812 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 21:07:36,812 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 21:07:36,812 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 21:07:36,812 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 21:07:36,812 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 21:07:36,812 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 21:07:36,812 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 21:07:36,812 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 21:07:36,813 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= 15 ~a8~0)) (.cse5 (= ~a20~0 1))) (let ((.cse2 (= ~a16~0 5)) (.cse3 (= 13 ~a8~0)) (.cse11 (not .cse5)) (.cse0 (= 1 ~a7~0)) (.cse8 (= ~a16~0 4)) (.cse9 (not .cse1)) (.cse4 (= ~a17~0 1)) (.cse10 (= ~a12~0 8)) (.cse7 (<= ~a17~0 0)) (.cse6 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse2) (and .cse8 .cse9 .cse7) (and .cse4 .cse10 .cse6 (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse1 .cse2) (and .cse0 .cse4 .cse6) (and .cse11 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse10 .cse4 .cse6 .cse1) (and .cse0 .cse3) (and .cse0 .cse9 .cse7) (and .cse11 .cse4 .cse10 .cse6 .cse1 (not .cse8)) (and .cse8 .cse7 (not .cse0) .cse5) (and .cse8 .cse9 .cse4 .cse6 .cse5) (and .cse10 .cse7 .cse6 .cse1)))) [2019-12-07 21:07:36,813 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 21:07:36,813 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 21:07:36,813 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-12-07 21:07:36,813 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 21:07:36,813 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 21:07:36,813 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 21:07:36,813 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 21:07:36,813 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 21:07:36,813 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 21:07:36,813 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 21:07:36,813 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 21:07:36,813 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 21:07:36,813 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 21:07:36,813 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 21:07:36,813 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 21:07:36,813 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 21:07:36,814 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 21:07:36,814 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 21:07:36,814 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 21:07:36,814 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 21:07:36,814 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 21:07:36,814 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 21:07:36,814 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 21:07:36,814 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 21:07:36,814 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 21:07:36,814 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= 15 ~a8~0)) (.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a16~0 5)) (.cse6 (= 13 ~a8~0)) (.cse11 (not .cse7)) (.cse5 (= 1 ~a7~0)) (.cse9 (= ~a16~0 4)) (.cse10 (not .cse3)) (.cse0 (= ~a17~0 1)) (.cse1 (= ~a12~0 8)) (.cse8 (<= ~a17~0 0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse4) (and .cse6 .cse0 .cse7 .cse2) (and .cse8 .cse4) (and .cse9 .cse10 .cse8) (and .cse5 .cse0 .cse2) (and .cse11 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse1 .cse0 .cse2 .cse3) (and .cse5 .cse6) (and .cse5 .cse10 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse3 (not .cse9)) (and .cse9 .cse8 (not .cse5) .cse7) (and .cse9 .cse10 .cse0 .cse2 .cse7) (and .cse1 .cse8 .cse2 .cse3)))) [2019-12-07 21:07:36,814 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 21:07:36,814 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 21:07:36,814 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 21:07:36,814 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 21:07:36,814 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 21:07:36,814 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 21:07:36,814 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 443) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 21:07:36,815 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 21:07:36,816 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 21:07:36,816 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 21:07:36,816 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 21:07:36,816 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 21:07:36,816 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 21:07:36,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:07:36 BoogieIcfgContainer [2019-12-07 21:07:36,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:07:36,832 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:07:36,832 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:07:36,832 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:07:36,833 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:07:30" (3/4) ... [2019-12-07 21:07:36,835 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 21:07:36,849 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-12-07 21:07:36,850 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 21:07:36,851 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 21:07:36,852 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 21:07:36,929 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7fbaed3b-ac56-4c11-8db1-517ac9d91f44/bin/utaipan/witness.graphml [2019-12-07 21:07:36,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:07:36,930 INFO L168 Benchmark]: Toolchain (without parser) took 7662.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.2 MB). Free memory was 935.5 MB in the beginning and 883.9 MB in the end (delta: 51.6 MB). Peak memory consumption was 282.8 MB. Max. memory is 11.5 GB. [2019-12-07 21:07:36,930 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:07:36,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -138.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:07:36,931 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:07:36,931 INFO L168 Benchmark]: Boogie Preprocessor took 38.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:07:36,931 INFO L168 Benchmark]: RCFGBuilder took 1150.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 854.6 MB in the end (delta: 208.2 MB). Peak memory consumption was 208.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:07:36,931 INFO L168 Benchmark]: TraceAbstraction took 5971.49 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 130.5 MB). Free memory was 854.6 MB in the beginning and 903.2 MB in the end (delta: -48.6 MB). Peak memory consumption was 82.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:07:36,932 INFO L168 Benchmark]: Witness Printer took 97.02 ms. Allocated memory is still 1.3 GB. Free memory was 903.2 MB in the beginning and 883.9 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:07:36,933 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 350.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -138.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1150.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 854.6 MB in the end (delta: 208.2 MB). Peak memory consumption was 208.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5971.49 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 130.5 MB). Free memory was 854.6 MB in the beginning and 903.2 MB in the end (delta: -48.6 MB). Peak memory consumption was 82.0 MB. Max. memory is 11.5 GB. * Witness Printer took 97.02 ms. Allocated memory is still 1.3 GB. Free memory was 903.2 MB in the beginning and 883.9 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 443]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((1 == a7 && 15 == a8) && a16 == 5) || (((13 == a8 && a17 == 1) && a20 == 1) && a21 == 1)) || (a17 <= 0 && a16 == 5)) || ((a16 == 4 && !(15 == a8)) && a17 <= 0)) || (((((a17 == 1 && a12 == 8) && a21 == 1) && !(1 == input)) && 15 == a8) && a16 == 5)) || ((1 == a7 && a17 == 1) && a21 == 1)) || (((((!(a20 == 1) && (((2 == input || 3 == input) || 6 == input) || 5 == input)) && a12 == 8) && a17 == 1) && a21 == 1) && 15 == a8)) || (1 == a7 && 13 == a8)) || ((1 == a7 && !(15 == a8)) && a17 <= 0)) || (((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || (((a16 == 4 && a17 <= 0) && !(1 == a7)) && a20 == 1)) || ((((a16 == 4 && !(15 == a8)) && a17 == 1) && a21 == 1) && a20 == 1)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && 15 == a8) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((a17 == 1 && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5) || ((1 == a7 && 15 == a8) && a16 == 5)) || (((13 == a8 && a17 == 1) && a20 == 1) && a21 == 1)) || (a17 <= 0 && a16 == 5)) || ((a16 == 4 && !(15 == a8)) && a17 <= 0)) || ((1 == a7 && a17 == 1) && a21 == 1)) || (((((!(a20 == 1) && (((2 == input || 3 == input) || 6 == input) || 5 == input)) && a12 == 8) && a17 == 1) && a21 == 1) && 15 == a8)) || (1 == a7 && 13 == a8)) || ((1 == a7 && !(15 == a8)) && a17 <= 0)) || (((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || (((a16 == 4 && a17 <= 0) && !(1 == a7)) && a20 == 1)) || ((((a16 == 4 && !(15 == a8)) && a17 == 1) && a21 == 1) && a20 == 1)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && 15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 5.2s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 622 SDtfs, 1613 SDslu, 110 SDs, 0 SdLazy, 4316 SolverSat, 738 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1174occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 935 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 56 NumberOfFragments, 367 HoareAnnotationTreeSize, 3 FomulaSimplifications, 8142 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1076 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1227 NumberOfCodeBlocks, 1227 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1216 ConstructedInterpolants, 0 QuantifiedInterpolants, 744142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 627/627 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...