./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_aa844d5a-da7a-4a7c-ab36-eff5c0796a8d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_aa844d5a-da7a-4a7c-ab36-eff5c0796a8d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_aa844d5a-da7a-4a7c-ab36-eff5c0796a8d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_aa844d5a-da7a-4a7c-ab36-eff5c0796a8d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label10.c -s /tmp/vcloud-vcloud-master/worker/run_dir_aa844d5a-da7a-4a7c-ab36-eff5c0796a8d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_aa844d5a-da7a-4a7c-ab36-eff5c0796a8d/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 d90d90ab0f83213f6e486d9f5a42850d0f82e05d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:34:45,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:34:45,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:34:45,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:34:45,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:34:45,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:34:45,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:34:45,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:34:45,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:34:45,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:34:45,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:34:45,970 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:34:45,970 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:34:45,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:34:45,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:34:45,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:34:45,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:34:45,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:34:45,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:34:45,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:34:45,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:34:45,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:34:45,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:34:45,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:34:45,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:34:45,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:34:45,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:34:45,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:34:45,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:34:45,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:34:45,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:34:45,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:34:45,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:34:45,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:34:45,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:34:45,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:34:45,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:34:45,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:34:45,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:34:46,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:34:46,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:34:46,002 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_aa844d5a-da7a-4a7c-ab36-eff5c0796a8d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:34:46,025 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:34:46,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:34:46,035 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:34:46,036 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:34:46,036 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:34:46,036 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:34:46,036 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:34:46,037 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:34:46,037 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:34:46,037 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:34:46,037 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:34:46,037 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:34:46,038 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:34:46,038 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:34:46,038 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:34:46,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:34:46,040 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:34:46,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:34:46,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:34:46,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:34:46,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:34:46,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:34:46,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:34:46,041 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:34:46,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:34:46,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:34:46,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:34:46,042 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:34:46,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:34:46,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:34:46,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:34:46,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:34:46,043 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:34:46,044 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:34:46,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:34:46,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:34:46,044 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:34:46,044 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_aa844d5a-da7a-4a7c-ab36-eff5c0796a8d/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 -> d90d90ab0f83213f6e486d9f5a42850d0f82e05d [2019-11-26 02:34:46,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:34:46,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:34:46,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:34:46,196 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:34:46,196 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:34:46,197 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_aa844d5a-da7a-4a7c-ab36-eff5c0796a8d/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label10.c [2019-11-26 02:34:46,245 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aa844d5a-da7a-4a7c-ab36-eff5c0796a8d/bin/utaipan/data/ec4d88c42/65fc98474d1e4283a9742b2fe3f8b5b3/FLAG4e8c93e7b [2019-11-26 02:34:46,731 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:34:46,732 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_aa844d5a-da7a-4a7c-ab36-eff5c0796a8d/sv-benchmarks/c/eca-rers2012/Problem01_label10.c [2019-11-26 02:34:46,739 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aa844d5a-da7a-4a7c-ab36-eff5c0796a8d/bin/utaipan/data/ec4d88c42/65fc98474d1e4283a9742b2fe3f8b5b3/FLAG4e8c93e7b [2019-11-26 02:34:46,751 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_aa844d5a-da7a-4a7c-ab36-eff5c0796a8d/bin/utaipan/data/ec4d88c42/65fc98474d1e4283a9742b2fe3f8b5b3 [2019-11-26 02:34:46,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:34:46,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:34:46,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:34:46,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:34:46,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:34:46,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:34:46" (1/1) ... [2019-11-26 02:34:46,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5416b782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:46, skipping insertion in model container [2019-11-26 02:34:46,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:34:46" (1/1) ... [2019-11-26 02:34:46,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:34:46,817 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:34:47,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:34:47,340 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:34:47,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:34:47,463 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:34:47,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:47 WrapperNode [2019-11-26 02:34:47,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:34:47,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:34:47,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:34:47,466 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:34:47,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:47" (1/1) ... [2019-11-26 02:34:47,499 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:47" (1/1) ... [2019-11-26 02:34:47,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:34:47,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:34:47,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:34:47,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:34:47,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:47" (1/1) ... [2019-11-26 02:34:47,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:47" (1/1) ... [2019-11-26 02:34:47,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:47" (1/1) ... [2019-11-26 02:34:47,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:47" (1/1) ... [2019-11-26 02:34:47,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:47" (1/1) ... [2019-11-26 02:34:47,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:47" (1/1) ... [2019-11-26 02:34:47,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:47" (1/1) ... [2019-11-26 02:34:47,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:34:47,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:34:47,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:34:47,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:34:47,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa844d5a-da7a-4a7c-ab36-eff5c0796a8d/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-11-26 02:34:47,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:34:47,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:34:49,591 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:34:49,591 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:34:49,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:34:49 BoogieIcfgContainer [2019-11-26 02:34:49,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:34:49,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:34:49,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:34:49,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:34:49,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:34:46" (1/3) ... [2019-11-26 02:34:49,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b90573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:34:49, skipping insertion in model container [2019-11-26 02:34:49,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:47" (2/3) ... [2019-11-26 02:34:49,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b90573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:34:49, skipping insertion in model container [2019-11-26 02:34:49,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:34:49" (3/3) ... [2019-11-26 02:34:49,600 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label10.c [2019-11-26 02:34:49,611 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:34:49,617 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:34:49,628 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:34:49,666 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:34:49,667 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:34:49,667 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:34:49,667 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:34:49,667 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:34:49,667 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:34:49,667 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:34:49,668 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:34:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:34:49,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:34:49,697 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:49,698 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-11-26 02:34:49,698 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:49,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:49,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1323234201, now seen corresponding path program 1 times [2019-11-26 02:34:49,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:49,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515772186] [2019-11-26 02:34:49,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:34:50,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515772186] [2019-11-26 02:34:50,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:50,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:34:50,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936207064] [2019-11-26 02:34:50,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:34:50,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:50,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:34:50,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:34:50,196 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-26 02:34:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:50,888 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-26 02:34:50,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:34:50,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:34:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:50,907 INFO L225 Difference]: With dead ends: 297 [2019-11-26 02:34:50,908 INFO L226 Difference]: Without dead ends: 216 [2019-11-26 02:34:50,911 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-11-26 02:34:50,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-26 02:34:50,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-26 02:34:50,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-26 02:34:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-11-26 02:34:50,959 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 71 [2019-11-26 02:34:50,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:50,960 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-11-26 02:34:50,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:34:50,960 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-11-26 02:34:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-26 02:34:50,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:50,964 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:34:50,964 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:50,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:50,965 INFO L82 PathProgramCache]: Analyzing trace with hash 585783519, now seen corresponding path program 1 times [2019-11-26 02:34:50,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:50,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233090126] [2019-11-26 02:34:50,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:34:51,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233090126] [2019-11-26 02:34:51,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:51,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:34:51,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86696687] [2019-11-26 02:34:51,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:34:51,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:51,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:34:51,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:34:51,012 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 4 states. [2019-11-26 02:34:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:51,462 INFO L93 Difference]: Finished difference Result 644 states and 1131 transitions. [2019-11-26 02:34:51,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:34:51,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-26 02:34:51,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:51,465 INFO L225 Difference]: With dead ends: 644 [2019-11-26 02:34:51,466 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:34:51,468 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-11-26 02:34:51,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:34:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-26 02:34:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-26 02:34:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 705 transitions. [2019-11-26 02:34:51,493 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 705 transitions. Word has length 76 [2019-11-26 02:34:51,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:51,493 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 705 transitions. [2019-11-26 02:34:51,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:34:51,493 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 705 transitions. [2019-11-26 02:34:51,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-26 02:34:51,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:51,498 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:34:51,498 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:51,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:51,499 INFO L82 PathProgramCache]: Analyzing trace with hash 928590825, now seen corresponding path program 1 times [2019-11-26 02:34:51,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:51,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275548407] [2019-11-26 02:34:51,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:34:51,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275548407] [2019-11-26 02:34:51,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:51,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:34:51,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361451685] [2019-11-26 02:34:51,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:34:51,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:51,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:34:51,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:34:51,562 INFO L87 Difference]: Start difference. First operand 429 states and 705 transitions. Second operand 3 states. [2019-11-26 02:34:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:51,936 INFO L93 Difference]: Finished difference Result 1070 states and 1785 transitions. [2019-11-26 02:34:51,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:34:51,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-26 02:34:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:51,940 INFO L225 Difference]: With dead ends: 1070 [2019-11-26 02:34:51,940 INFO L226 Difference]: Without dead ends: 642 [2019-11-26 02:34:51,941 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-11-26 02:34:51,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-26 02:34:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 500. [2019-11-26 02:34:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-26 02:34:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 825 transitions. [2019-11-26 02:34:51,976 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 825 transitions. Word has length 97 [2019-11-26 02:34:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:51,978 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 825 transitions. [2019-11-26 02:34:51,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:34:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 825 transitions. [2019-11-26 02:34:51,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-26 02:34:51,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:51,989 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:34:51,990 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:51,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:51,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1330793460, now seen corresponding path program 1 times [2019-11-26 02:34:51,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:51,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645169026] [2019-11-26 02:34:51,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-26 02:34:52,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645169026] [2019-11-26 02:34:52,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:52,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:34:52,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100374405] [2019-11-26 02:34:52,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:34:52,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:52,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:34:52,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:34:52,106 INFO L87 Difference]: Start difference. First operand 500 states and 825 transitions. Second operand 3 states. [2019-11-26 02:34:52,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:52,451 INFO L93 Difference]: Finished difference Result 1212 states and 1976 transitions. [2019-11-26 02:34:52,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:34:52,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-26 02:34:52,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:52,456 INFO L225 Difference]: With dead ends: 1212 [2019-11-26 02:34:52,457 INFO L226 Difference]: Without dead ends: 713 [2019-11-26 02:34:52,457 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-11-26 02:34:52,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-26 02:34:52,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 571. [2019-11-26 02:34:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-26 02:34:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 889 transitions. [2019-11-26 02:34:52,475 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 889 transitions. Word has length 133 [2019-11-26 02:34:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:52,475 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 889 transitions. [2019-11-26 02:34:52,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:34:52,476 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 889 transitions. [2019-11-26 02:34:52,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-26 02:34:52,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:52,478 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-26 02:34:52,478 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:52,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:52,478 INFO L82 PathProgramCache]: Analyzing trace with hash -573611104, now seen corresponding path program 1 times [2019-11-26 02:34:52,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:52,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355258746] [2019-11-26 02:34:52,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-26 02:34:52,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355258746] [2019-11-26 02:34:52,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:52,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:34:52,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31758484] [2019-11-26 02:34:52,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:34:52,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:52,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:34:52,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:34:52,605 INFO L87 Difference]: Start difference. First operand 571 states and 889 transitions. Second operand 4 states. [2019-11-26 02:34:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:53,013 INFO L93 Difference]: Finished difference Result 1229 states and 1883 transitions. [2019-11-26 02:34:53,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:34:53,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-26 02:34:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:53,019 INFO L225 Difference]: With dead ends: 1229 [2019-11-26 02:34:53,019 INFO L226 Difference]: Without dead ends: 659 [2019-11-26 02:34:53,020 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-11-26 02:34:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-26 02:34:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 642. [2019-11-26 02:34:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-26 02:34:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 966 transitions. [2019-11-26 02:34:53,058 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 966 transitions. Word has length 141 [2019-11-26 02:34:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:53,059 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 966 transitions. [2019-11-26 02:34:53,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:34:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 966 transitions. [2019-11-26 02:34:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-26 02:34:53,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:53,060 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-26 02:34:53,060 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:53,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:53,061 INFO L82 PathProgramCache]: Analyzing trace with hash 925212632, now seen corresponding path program 1 times [2019-11-26 02:34:53,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:53,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328714687] [2019-11-26 02:34:53,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-26 02:34:53,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328714687] [2019-11-26 02:34:53,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:53,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:34:53,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517775589] [2019-11-26 02:34:53,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:34:53,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:53,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:34:53,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:34:53,159 INFO L87 Difference]: Start difference. First operand 642 states and 966 transitions. Second operand 4 states. [2019-11-26 02:34:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:53,690 INFO L93 Difference]: Finished difference Result 1567 states and 2365 transitions. [2019-11-26 02:34:53,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:34:53,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-26 02:34:53,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:53,696 INFO L225 Difference]: With dead ends: 1567 [2019-11-26 02:34:53,696 INFO L226 Difference]: Without dead ends: 997 [2019-11-26 02:34:53,699 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-11-26 02:34:53,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-26 02:34:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 784. [2019-11-26 02:34:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-26 02:34:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1138 transitions. [2019-11-26 02:34:53,726 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1138 transitions. Word has length 145 [2019-11-26 02:34:53,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:53,731 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1138 transitions. [2019-11-26 02:34:53,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:34:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1138 transitions. [2019-11-26 02:34:53,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-26 02:34:53,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:53,735 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-26 02:34:53,735 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:53,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:53,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1683943653, now seen corresponding path program 1 times [2019-11-26 02:34:53,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:53,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535937896] [2019-11-26 02:34:53,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-26 02:34:53,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535937896] [2019-11-26 02:34:53,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:53,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:34:53,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961345704] [2019-11-26 02:34:53,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:34:53,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:53,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:34:53,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:34:53,961 INFO L87 Difference]: Start difference. First operand 784 states and 1138 transitions. Second operand 8 states. [2019-11-26 02:34:54,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:54,641 INFO L93 Difference]: Finished difference Result 1742 states and 2534 transitions. [2019-11-26 02:34:54,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:34:54,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-11-26 02:34:54,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:54,647 INFO L225 Difference]: With dead ends: 1742 [2019-11-26 02:34:54,648 INFO L226 Difference]: Without dead ends: 1030 [2019-11-26 02:34:54,649 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-11-26 02:34:54,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-11-26 02:34:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 926. [2019-11-26 02:34:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:34:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1316 transitions. [2019-11-26 02:34:54,674 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1316 transitions. Word has length 159 [2019-11-26 02:34:54,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:54,674 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1316 transitions. [2019-11-26 02:34:54,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:34:54,675 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1316 transitions. [2019-11-26 02:34:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-26 02:34:54,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:54,678 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-26 02:34:54,678 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:54,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:54,678 INFO L82 PathProgramCache]: Analyzing trace with hash 311590294, now seen corresponding path program 1 times [2019-11-26 02:34:54,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:54,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379964912] [2019-11-26 02:34:54,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:54,767 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-26 02:34:54,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379964912] [2019-11-26 02:34:54,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:54,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:34:54,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335794707] [2019-11-26 02:34:54,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:34:54,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:54,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:34:54,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:34:54,770 INFO L87 Difference]: Start difference. First operand 926 states and 1316 transitions. Second operand 4 states. [2019-11-26 02:34:55,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:55,277 INFO L93 Difference]: Finished difference Result 2277 states and 3219 transitions. [2019-11-26 02:34:55,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:34:55,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-26 02:34:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:55,283 INFO L225 Difference]: With dead ends: 2277 [2019-11-26 02:34:55,284 INFO L226 Difference]: Without dead ends: 1068 [2019-11-26 02:34:55,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-26 02:34:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-26 02:34:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 926. [2019-11-26 02:34:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:34:55,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1072 transitions. [2019-11-26 02:34:55,307 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1072 transitions. Word has length 162 [2019-11-26 02:34:55,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:55,307 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1072 transitions. [2019-11-26 02:34:55,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:34:55,308 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1072 transitions. [2019-11-26 02:34:55,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-26 02:34:55,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:55,311 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-11-26 02:34:55,311 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:55,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:55,311 INFO L82 PathProgramCache]: Analyzing trace with hash -114222837, now seen corresponding path program 1 times [2019-11-26 02:34:55,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:55,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052976461] [2019-11-26 02:34:55,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-26 02:34:55,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052976461] [2019-11-26 02:34:55,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954516946] [2019-11-26 02:34:55,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa844d5a-da7a-4a7c-ab36-eff5c0796a8d/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:34:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:55,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:34:55,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:34:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-26 02:34:55,663 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:34:55,721 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-26 02:34:55,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:34:55,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-26 02:34:55,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540126355] [2019-11-26 02:34:55,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:34:55,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:55,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:34:55,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:34:55,724 INFO L87 Difference]: Start difference. First operand 926 states and 1072 transitions. Second operand 3 states. [2019-11-26 02:34:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:55,991 INFO L93 Difference]: Finished difference Result 926 states and 1072 transitions. [2019-11-26 02:34:55,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:34:55,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-11-26 02:34:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:55,993 INFO L225 Difference]: With dead ends: 926 [2019-11-26 02:34:55,993 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:34:55,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 382 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:34:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:34:55,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:34:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:34:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:34:55,995 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 192 [2019-11-26 02:34:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:55,995 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:34:55,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:34:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:34:55,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:34:56,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:34:56,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:34:56,326 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 48 [2019-11-26 02:34:56,536 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 21 [2019-11-26 02:34:56,666 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 21 [2019-11-26 02:34:56,668 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:34:56,668 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:34:56,669 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:34:56,669 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:34:56,669 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:34:56,669 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:34:56,669 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:34:56,669 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:34:56,669 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:34:56,669 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:34:56,669 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:34:56,670 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:34:56,670 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:34:56,670 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:34:56,671 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:34:56,672 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:34:56,672 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:34:56,672 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:34:56,672 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-26 02:34:56,672 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:34:56,673 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (<= ~a21~0 0) (= 13 ~a8~0)) (and (not (= ~a16~0 6)) .cse0) (and .cse0 (= 15 ~a8~0)) (and (= ~a17~0 1) .cse0))) [2019-11-26 02:34:56,673 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:34:56,673 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:34:56,673 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:34:56,673 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:34:56,673 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:34:56,673 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:34:56,674 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:34:56,674 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:34:56,674 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:34:56,674 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:34:56,674 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:34:56,674 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:34:56,675 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:34:56,675 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:34:56,675 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:34:56,675 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:34:56,675 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:34:56,675 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:34:56,675 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:34:56,676 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:34:56,676 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:34:56,676 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:34:56,676 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:34:56,676 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (<= ~a21~0 0) (= 13 ~a8~0)) (and (not (= ~a16~0 6)) .cse0) (and .cse0 (= 15 ~a8~0)) (and (= ~a17~0 1) .cse0))) [2019-11-26 02:34:56,676 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:34:56,676 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:34:56,677 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:34:56,677 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:34:56,677 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:34:56,677 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:34:56,677 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:34:56,677 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:34:56,678 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:34:56,678 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:34:56,678 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:34:56,678 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:34:56,678 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:34:56,678 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:34:56,678 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:34:56,679 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:34:56,679 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:34:56,679 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:34:56,679 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:34:56,679 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:34:56,679 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:34:56,679 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:34:56,680 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:34:56,680 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 506) no Hoare annotation was computed. [2019-11-26 02:34:56,680 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:34:56,680 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:34:56,680 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:34:56,680 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:34:56,681 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:34:56,681 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:34:56,681 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:34:56,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:34:56 BoogieIcfgContainer [2019-11-26 02:34:56,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:34:56,696 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:34:56,696 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:34:56,696 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:34:56,696 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:34:49" (3/4) ... [2019-11-26 02:34:56,699 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:34:56,718 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-11-26 02:34:56,719 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-26 02:34:56,721 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-26 02:34:56,722 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:34:56,884 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_aa844d5a-da7a-4a7c-ab36-eff5c0796a8d/bin/utaipan/witness.graphml [2019-11-26 02:34:56,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:34:56,886 INFO L168 Benchmark]: Toolchain (without parser) took 10130.98 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 246.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -204.4 MB). Peak memory consumption was 42.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:34:56,886 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:34:56,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 709.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:34:56,887 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:34:56,887 INFO L168 Benchmark]: Boogie Preprocessor took 65.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:34:56,887 INFO L168 Benchmark]: RCFGBuilder took 1968.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.1 MB in the end (delta: 218.9 MB). Peak memory consumption was 218.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:34:56,888 INFO L168 Benchmark]: TraceAbstraction took 7101.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.2 MB). Free memory was 914.1 MB in the beginning and 1.2 GB in the end (delta: -252.0 MB). Peak memory consumption was 126.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:34:56,888 INFO L168 Benchmark]: Witness Printer took 188.71 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:34:56,890 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 709.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1968.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.1 MB in the end (delta: 218.9 MB). Peak memory consumption was 218.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7101.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.2 MB). Free memory was 914.1 MB in the beginning and 1.2 GB in the end (delta: -252.0 MB). Peak memory consumption was 126.3 MB. Max. memory is 11.5 GB. * Witness Printer took 188.71 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 506]: 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: (((a21 <= 0 && 13 == a8) || (!(a16 == 6) && a21 == 1)) || (a21 == 1 && 15 == a8)) || (a17 == 1 && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((a21 <= 0 && 13 == a8) || (!(a16 == 6) && a21 == 1)) || (a21 == 1 && 15 == a8)) || (a17 == 1 && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 7.0s, OverallIterations: 9, TraceHistogramMax: 6, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 519 SDtfs, 1071 SDslu, 80 SDs, 0 SdLazy, 2988 SolverSat, 772 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 391 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=926occurred in iteration=7, 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, 9 MinimizatonAttempts, 760 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 61 HoareAnnotationTreeSize, 3 FomulaSimplifications, 10077 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 550 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1368 NumberOfCodeBlocks, 1368 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1549 ConstructedInterpolants, 0 QuantifiedInterpolants, 536643 SizeOfPredicates, 1 NumberOfNonLiveVariables, 430 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1736/1763 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...