./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label45.c -s /tmp/vcloud-vcloud-master/worker/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/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 6c1fad4c0512d9a273ed1e7c88caaf722fcdaad1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:21:29,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:29,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:29,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:29,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:29,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:29,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:29,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:29,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:29,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:29,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:29,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:29,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:29,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:29,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:29,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:29,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:29,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:29,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:29,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:29,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:29,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:29,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:29,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:29,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:29,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:29,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:29,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:29,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:29,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:29,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:29,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:29,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:29,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:29,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:29,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:29,800 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:29,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:29,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:29,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:29,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:29,804 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:21:29,820 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:29,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:29,823 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:29,823 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:29,824 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:29,824 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:29,824 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:29,824 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:29,824 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:29,824 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:29,824 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:29,824 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:29,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:29,825 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:29,825 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:29,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:29,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:29,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:29,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:29,826 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:29,827 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:29,828 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:29,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:29,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:29,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:29,828 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:29,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:29,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:29,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:29,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:29,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:29,829 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:29,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:29,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:29,830 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:29,830 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/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/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 -> 6c1fad4c0512d9a273ed1e7c88caaf722fcdaad1 [2019-10-22 11:21:29,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:29,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:29,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:29,878 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:29,879 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:29,879 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label45.c [2019-10-22 11:21:29,923 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/bin/utaipan/data/962c4b9a6/df3f281ac8674a79ac732f9296b83557/FLAGe5502d970 [2019-10-22 11:21:30,397 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:30,398 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/sv-benchmarks/c/eca-rers2012/Problem01_label45.c [2019-10-22 11:21:30,408 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/bin/utaipan/data/962c4b9a6/df3f281ac8674a79ac732f9296b83557/FLAGe5502d970 [2019-10-22 11:21:30,701 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/bin/utaipan/data/962c4b9a6/df3f281ac8674a79ac732f9296b83557 [2019-10-22 11:21:30,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:30,704 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:30,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:30,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:30,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:30,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:30" (1/1) ... [2019-10-22 11:21:30,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411f8c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:30, skipping insertion in model container [2019-10-22 11:21:30,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:30" (1/1) ... [2019-10-22 11:21:30,719 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:30,764 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:31,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:31,218 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:31,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:31,345 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:31,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:31 WrapperNode [2019-10-22 11:21:31,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:31,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:31,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:31,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:31,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:31" (1/1) ... [2019-10-22 11:21:31,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:31" (1/1) ... [2019-10-22 11:21:31,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:31,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:31,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:31,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:31,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:31" (1/1) ... [2019-10-22 11:21:31,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:31" (1/1) ... [2019-10-22 11:21:31,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:31" (1/1) ... [2019-10-22 11:21:31,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:31" (1/1) ... [2019-10-22 11:21:31,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:31" (1/1) ... [2019-10-22 11:21:31,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:31" (1/1) ... [2019-10-22 11:21:31,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:31" (1/1) ... [2019-10-22 11:21:31,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:31,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:31,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:31,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:31,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/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-10-22 11:21:31,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:31,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:32,456 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:32,456 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:21:32,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:32 BoogieIcfgContainer [2019-10-22 11:21:32,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:32,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:32,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:32,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:32,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:30" (1/3) ... [2019-10-22 11:21:32,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325b57f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:32, skipping insertion in model container [2019-10-22 11:21:32,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:31" (2/3) ... [2019-10-22 11:21:32,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325b57f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:32, skipping insertion in model container [2019-10-22 11:21:32,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:32" (3/3) ... [2019-10-22 11:21:32,466 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label45.c [2019-10-22 11:21:32,475 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:32,483 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:21:32,494 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:21:32,523 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:32,523 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:32,523 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:32,524 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:32,524 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:32,524 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:32,524 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:32,524 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-10-22 11:21:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-22 11:21:32,555 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:32,556 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:32,558 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:32,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:32,563 INFO L82 PathProgramCache]: Analyzing trace with hash -286323610, now seen corresponding path program 1 times [2019-10-22 11:21:32,571 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:32,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547194607] [2019-10-22 11:21:32,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:32,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:32,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:32,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547194607] [2019-10-22 11:21:32,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:32,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:32,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160945760] [2019-10-22 11:21:32,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:32,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:32,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:32,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:32,986 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-10-22 11:21:33,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:33,702 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-10-22 11:21:33,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:33,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-10-22 11:21:33,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:33,719 INFO L225 Difference]: With dead ends: 528 [2019-10-22 11:21:33,721 INFO L226 Difference]: Without dead ends: 266 [2019-10-22 11:21:33,724 INFO L600 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-10-22 11:21:33,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-10-22 11:21:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-10-22 11:21:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-22 11:21:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-10-22 11:21:33,784 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 117 [2019-10-22 11:21:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:33,784 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-10-22 11:21:33,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:33,784 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-10-22 11:21:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-22 11:21:33,792 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:33,793 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:33,793 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:33,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:33,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1653159310, now seen corresponding path program 1 times [2019-10-22 11:21:33,794 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:33,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400945105] [2019-10-22 11:21:33,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:33,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:33,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:33,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400945105] [2019-10-22 11:21:33,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:33,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:33,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844514692] [2019-10-22 11:21:33,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:33,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:33,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:33,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:33,877 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-10-22 11:21:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:34,374 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2019-10-22 11:21:34,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:34,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-22 11:21:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:34,377 INFO L225 Difference]: With dead ends: 792 [2019-10-22 11:21:34,377 INFO L226 Difference]: Without dead ends: 528 [2019-10-22 11:21:34,379 INFO L600 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-10-22 11:21:34,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-10-22 11:21:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-10-22 11:21:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-10-22 11:21:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 720 transitions. [2019-10-22 11:21:34,410 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 720 transitions. Word has length 122 [2019-10-22 11:21:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:34,411 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 720 transitions. [2019-10-22 11:21:34,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 720 transitions. [2019-10-22 11:21:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-22 11:21:34,418 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:34,419 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:34,419 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:34,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:34,419 INFO L82 PathProgramCache]: Analyzing trace with hash -691237342, now seen corresponding path program 1 times [2019-10-22 11:21:34,419 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:34,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601700238] [2019-10-22 11:21:34,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:34,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:34,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:34,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601700238] [2019-10-22 11:21:34,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:34,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:34,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127567803] [2019-10-22 11:21:34,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:34,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:34,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:34,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:34,481 INFO L87 Difference]: Start difference. First operand 528 states and 720 transitions. Second operand 3 states. [2019-10-22 11:21:34,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:34,890 INFO L93 Difference]: Finished difference Result 1185 states and 1617 transitions. [2019-10-22 11:21:34,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:34,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-10-22 11:21:34,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:34,893 INFO L225 Difference]: With dead ends: 1185 [2019-10-22 11:21:34,893 INFO L226 Difference]: Without dead ends: 659 [2019-10-22 11:21:34,895 INFO L600 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-10-22 11:21:34,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-22 11:21:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 528. [2019-10-22 11:21:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-10-22 11:21:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 714 transitions. [2019-10-22 11:21:34,907 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 714 transitions. Word has length 130 [2019-10-22 11:21:34,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:34,907 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 714 transitions. [2019-10-22 11:21:34,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 714 transitions. [2019-10-22 11:21:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-22 11:21:34,912 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:34,912 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:34,913 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:34,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:34,913 INFO L82 PathProgramCache]: Analyzing trace with hash -183469584, now seen corresponding path program 1 times [2019-10-22 11:21:34,913 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:34,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869898672] [2019-10-22 11:21:34,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:34,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:34,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 11:21:35,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869898672] [2019-10-22 11:21:35,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:35,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:35,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221648260] [2019-10-22 11:21:35,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:35,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:35,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:35,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:35,019 INFO L87 Difference]: Start difference. First operand 528 states and 714 transitions. Second operand 4 states. [2019-10-22 11:21:35,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:35,623 INFO L93 Difference]: Finished difference Result 1971 states and 2669 transitions. [2019-10-22 11:21:35,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:35,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-22 11:21:35,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:35,628 INFO L225 Difference]: With dead ends: 1971 [2019-10-22 11:21:35,628 INFO L226 Difference]: Without dead ends: 1445 [2019-10-22 11:21:35,630 INFO L600 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-10-22 11:21:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-10-22 11:21:35,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314. [2019-10-22 11:21:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-10-22 11:21:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1706 transitions. [2019-10-22 11:21:35,669 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1706 transitions. Word has length 139 [2019-10-22 11:21:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:35,670 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1706 transitions. [2019-10-22 11:21:35,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1706 transitions. [2019-10-22 11:21:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-22 11:21:35,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:35,674 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:35,674 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:35,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:35,675 INFO L82 PathProgramCache]: Analyzing trace with hash 7667169, now seen corresponding path program 1 times [2019-10-22 11:21:35,675 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:35,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753774508] [2019-10-22 11:21:35,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:35,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:35,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 11:21:35,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753774508] [2019-10-22 11:21:35,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:35,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:35,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832708879] [2019-10-22 11:21:35,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:35,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:35,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:35,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:35,788 INFO L87 Difference]: Start difference. First operand 1314 states and 1706 transitions. Second operand 4 states. [2019-10-22 11:21:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:36,329 INFO L93 Difference]: Finished difference Result 2762 states and 3564 transitions. [2019-10-22 11:21:36,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:36,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-10-22 11:21:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:36,333 INFO L225 Difference]: With dead ends: 2762 [2019-10-22 11:21:36,333 INFO L226 Difference]: Without dead ends: 1450 [2019-10-22 11:21:36,335 INFO L600 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-10-22 11:21:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-10-22 11:21:36,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2019-10-22 11:21:36,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-10-22 11:21:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1843 transitions. [2019-10-22 11:21:36,366 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1843 transitions. Word has length 145 [2019-10-22 11:21:36,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:36,367 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1843 transitions. [2019-10-22 11:21:36,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:36,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1843 transitions. [2019-10-22 11:21:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-22 11:21:36,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:36,370 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:36,370 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:36,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1656987991, now seen corresponding path program 1 times [2019-10-22 11:21:36,371 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:36,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728345405] [2019-10-22 11:21:36,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:36,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:36,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 11:21:36,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728345405] [2019-10-22 11:21:36,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:36,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:36,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502719516] [2019-10-22 11:21:36,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:36,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:36,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:36,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:36,453 INFO L87 Difference]: Start difference. First operand 1445 states and 1843 transitions. Second operand 5 states. [2019-10-22 11:21:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:37,208 INFO L93 Difference]: Finished difference Result 2888 states and 3696 transitions. [2019-10-22 11:21:37,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:37,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-10-22 11:21:37,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:37,213 INFO L225 Difference]: With dead ends: 2888 [2019-10-22 11:21:37,213 INFO L226 Difference]: Without dead ends: 1576 [2019-10-22 11:21:37,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:37,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-10-22 11:21:37,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-10-22 11:21:37,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-10-22 11:21:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1968 transitions. [2019-10-22 11:21:37,241 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1968 transitions. Word has length 149 [2019-10-22 11:21:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:37,241 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1968 transitions. [2019-10-22 11:21:37,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1968 transitions. [2019-10-22 11:21:37,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-22 11:21:37,244 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:37,244 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:37,244 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:37,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:37,244 INFO L82 PathProgramCache]: Analyzing trace with hash 945952174, now seen corresponding path program 1 times [2019-10-22 11:21:37,244 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:37,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874299950] [2019-10-22 11:21:37,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:37,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:37,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 11:21:37,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874299950] [2019-10-22 11:21:37,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:37,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:37,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865051857] [2019-10-22 11:21:37,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:37,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:37,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:37,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:37,299 INFO L87 Difference]: Start difference. First operand 1576 states and 1968 transitions. Second operand 3 states. [2019-10-22 11:21:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:37,710 INFO L93 Difference]: Finished difference Result 3674 states and 4634 transitions. [2019-10-22 11:21:37,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:37,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-22 11:21:37,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:37,716 INFO L225 Difference]: With dead ends: 3674 [2019-10-22 11:21:37,717 INFO L226 Difference]: Without dead ends: 1969 [2019-10-22 11:21:37,718 INFO L600 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-10-22 11:21:37,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-10-22 11:21:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-10-22 11:21:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-10-22 11:21:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1924 transitions. [2019-10-22 11:21:37,746 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1924 transitions. Word has length 152 [2019-10-22 11:21:37,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:37,747 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1924 transitions. [2019-10-22 11:21:37,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:37,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1924 transitions. [2019-10-22 11:21:37,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-22 11:21:37,749 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:37,750 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:37,750 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:37,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:37,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1818027434, now seen corresponding path program 1 times [2019-10-22 11:21:37,750 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:37,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564152863] [2019-10-22 11:21:37,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:37,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:37,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:37,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564152863] [2019-10-22 11:21:37,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:37,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:37,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746408125] [2019-10-22 11:21:37,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:37,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:37,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:37,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:37,837 INFO L87 Difference]: Start difference. First operand 1707 states and 1924 transitions. Second operand 5 states. [2019-10-22 11:21:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:38,642 INFO L93 Difference]: Finished difference Result 4591 states and 5242 transitions. [2019-10-22 11:21:38,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:38,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2019-10-22 11:21:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:38,651 INFO L225 Difference]: With dead ends: 4591 [2019-10-22 11:21:38,651 INFO L226 Difference]: Without dead ends: 3017 [2019-10-22 11:21:38,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2019-10-22 11:21:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 2493. [2019-10-22 11:21:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-10-22 11:21:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2761 transitions. [2019-10-22 11:21:38,697 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2761 transitions. Word has length 167 [2019-10-22 11:21:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:38,697 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 2761 transitions. [2019-10-22 11:21:38,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2761 transitions. [2019-10-22 11:21:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-22 11:21:38,702 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:38,703 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-10-22 11:21:38,703 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:38,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1902421532, now seen corresponding path program 1 times [2019-10-22 11:21:38,703 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:38,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852313482] [2019-10-22 11:21:38,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:38,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:38,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 5 proven. 109 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-22 11:21:39,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852313482] [2019-10-22 11:21:39,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049488006] [2019-10-22 11:21:39,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/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-10-22 11:21:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:39,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:39,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-22 11:21:39,209 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-22 11:21:39,273 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:21:39,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2019-10-22 11:21:39,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115424343] [2019-10-22 11:21:39,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:39,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:39,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:39,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:39,275 INFO L87 Difference]: Start difference. First operand 2493 states and 2761 transitions. Second operand 3 states. [2019-10-22 11:21:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:39,643 INFO L93 Difference]: Finished difference Result 5246 states and 5799 transitions. [2019-10-22 11:21:39,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:39,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-10-22 11:21:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:39,651 INFO L225 Difference]: With dead ends: 5246 [2019-10-22 11:21:39,652 INFO L226 Difference]: Without dead ends: 2755 [2019-10-22 11:21:39,655 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 440 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:39,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-10-22 11:21:39,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2231. [2019-10-22 11:21:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2019-10-22 11:21:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2446 transitions. [2019-10-22 11:21:39,690 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2446 transitions. Word has length 221 [2019-10-22 11:21:39,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:39,691 INFO L462 AbstractCegarLoop]: Abstraction has 2231 states and 2446 transitions. [2019-10-22 11:21:39,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:39,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2446 transitions. [2019-10-22 11:21:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-22 11:21:39,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:39,696 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:39,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:39,897 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:39,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:39,897 INFO L82 PathProgramCache]: Analyzing trace with hash -770011340, now seen corresponding path program 1 times [2019-10-22 11:21:39,897 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:39,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590009374] [2019-10-22 11:21:39,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:39,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:39,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 173 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-22 11:21:40,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590009374] [2019-10-22 11:21:40,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784890503] [2019-10-22 11:21:40,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:40,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:40,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-10-22 11:21:40,297 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-10-22 11:21:40,347 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:21:40,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-10-22 11:21:40,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093821297] [2019-10-22 11:21:40,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:40,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:40,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:40,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:40,348 INFO L87 Difference]: Start difference. First operand 2231 states and 2446 transitions. Second operand 3 states. [2019-10-22 11:21:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:40,770 INFO L93 Difference]: Finished difference Result 5113 states and 5613 transitions. [2019-10-22 11:21:40,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:40,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-10-22 11:21:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:40,772 INFO L225 Difference]: With dead ends: 5113 [2019-10-22 11:21:40,772 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:21:40,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 518 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-10-22 11:21:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:21:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:21:40,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:21:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:21:40,777 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 260 [2019-10-22 11:21:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:40,777 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:21:40,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:40,777 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:21:40,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:21:40,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:40,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:21:41,173 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 33 [2019-10-22 11:21:41,286 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 33 [2019-10-22 11:21:41,288 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-22 11:21:41,288 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-22 11:21:41,288 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,288 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,288 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,289 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,289 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,289 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,289 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-22 11:21:41,289 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-22 11:21:41,289 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-10-22 11:21:41,289 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-10-22 11:21:41,289 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-10-22 11:21:41,289 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-10-22 11:21:41,289 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-10-22 11:21:41,289 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-10-22 11:21:41,289 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-22 11:21:41,289 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 527) no Hoare annotation was computed. [2019-10-22 11:21:41,290 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-22 11:21:41,290 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,290 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,290 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,290 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,290 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,290 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,291 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-22 11:21:41,291 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-22 11:21:41,291 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-10-22 11:21:41,291 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-10-22 11:21:41,291 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-22 11:21:41,291 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-10-22 11:21:41,291 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-10-22 11:21:41,291 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-10-22 11:21:41,292 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-22 11:21:41,292 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-22 11:21:41,292 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-22 11:21:41,292 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-22 11:21:41,292 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-22 11:21:41,292 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-22 11:21:41,292 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-10-22 11:21:41,292 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,292 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,292 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,292 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,292 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,292 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-22 11:21:41,292 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-22 11:21:41,293 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-10-22 11:21:41,293 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-10-22 11:21:41,293 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-10-22 11:21:41,293 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-10-22 11:21:41,293 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-22 11:21:41,294 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-10-22 11:21:41,294 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-22 11:21:41,294 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0)) (.cse1 (= ~a20~0 1)) (.cse3 (<= 14 ~a8~0)) (.cse2 (= ~a17~0 1)) (.cse4 (= ~a21~0 1))) (or (and .cse0 (<= ~a17~0 0) .cse1) (and .cse0 .cse2 .cse1 (= ~a16~0 5)) (<= ~a16~0 4) (and .cse3 (= 5 ~a16~0)) (= 15 ~a8~0) (and .cse0 .cse2 (and (not (= ~a16~0 6)) .cse4)) (and .cse2 .cse4 .cse1) (and .cse3 .cse2 .cse4))) [2019-10-22 11:21:41,296 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,297 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,297 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,297 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,297 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,297 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-22 11:21:41,297 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-22 11:21:41,297 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-10-22 11:21:41,297 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-10-22 11:21:41,297 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-10-22 11:21:41,297 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-22 11:21:41,297 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-22 11:21:41,297 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-22 11:21:41,297 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-22 11:21:41,297 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-22 11:21:41,298 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-22 11:21:41,298 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-22 11:21:41,298 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-22 11:21:41,298 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-10-22 11:21:41,298 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,298 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,298 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,298 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,298 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,298 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-22 11:21:41,298 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-22 11:21:41,298 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-22 11:21:41,298 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-22 11:21:41,298 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-10-22 11:21:41,298 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-10-22 11:21:41,299 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-10-22 11:21:41,299 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-10-22 11:21:41,299 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-22 11:21:41,299 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,299 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,299 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,299 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,299 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-22 11:21:41,299 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,299 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-22 11:21:41,299 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-22 11:21:41,299 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-22 11:21:41,299 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-10-22 11:21:41,299 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-22 11:21:41,299 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-10-22 11:21:41,300 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-10-22 11:21:41,300 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:21:41,300 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-22 11:21:41,300 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-22 11:21:41,300 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-22 11:21:41,300 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-22 11:21:41,300 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-22 11:21:41,300 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-22 11:21:41,300 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,300 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0)) (.cse1 (= ~a20~0 1)) (.cse3 (<= 14 ~a8~0)) (.cse2 (= ~a17~0 1)) (.cse4 (= ~a21~0 1))) (or (and .cse0 (<= ~a17~0 0) .cse1) (and .cse0 .cse2 .cse1 (= ~a16~0 5)) (<= ~a16~0 4) (and .cse3 (= 5 ~a16~0)) (= 15 ~a8~0) (and .cse0 .cse2 (and (not (= ~a16~0 6)) .cse4)) (and .cse2 .cse4 .cse1) (and .cse3 .cse2 .cse4))) [2019-10-22 11:21:41,300 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,301 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,301 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,301 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,301 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-22 11:21:41,301 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-10-22 11:21:41,301 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-10-22 11:21:41,301 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-10-22 11:21:41,301 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-10-22 11:21:41,301 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-22 11:21:41,301 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-22 11:21:41,301 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-22 11:21:41,301 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,301 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,301 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,302 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,302 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,302 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-22 11:21:41,302 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:21:41,302 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-22 11:21:41,302 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-22 11:21:41,302 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-22 11:21:41,302 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-22 11:21:41,302 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-22 11:21:41,305 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-10-22 11:21:41,305 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-10-22 11:21:41,305 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-10-22 11:21:41,305 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-22 11:21:41,305 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-22 11:21:41,305 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-22 11:21:41,305 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,305 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,306 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,306 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,306 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-10-22 11:21:41,306 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,306 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,306 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-22 11:21:41,306 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-22 11:21:41,306 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:21:41,306 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-10-22 11:21:41,306 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-10-22 11:21:41,306 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-10-22 11:21:41,306 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-10-22 11:21:41,306 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-10-22 11:21:41,306 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-10-22 11:21:41,307 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-22 11:21:41,307 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-22 11:21:41,307 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-22 11:21:41,307 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-22 11:21:41,307 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,307 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,307 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,307 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,307 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,307 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-22 11:21:41,307 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,307 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-22 11:21:41,307 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-22 11:21:41,307 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-22 11:21:41,308 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-22 11:21:41,308 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-22 11:21:41,308 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-22 11:21:41,308 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-10-22 11:21:41,308 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-10-22 11:21:41,308 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-22 11:21:41,308 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-22 11:21:41,308 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-22 11:21:41,308 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:21:41,308 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-22 11:21:41,308 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-22 11:21:41,308 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-22 11:21:41,308 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,308 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,308 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,309 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,309 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,309 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:41,309 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-22 11:21:41,309 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-22 11:21:41,309 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-10-22 11:21:41,309 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-10-22 11:21:41,309 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-10-22 11:21:41,309 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-10-22 11:21:41,309 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-10-22 11:21:41,309 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-22 11:21:41,309 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-22 11:21:41,309 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-22 11:21:41,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:41 BoogieIcfgContainer [2019-10-22 11:21:41,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:41,335 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:41,335 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:41,335 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:41,335 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:32" (3/4) ... [2019-10-22 11:21:41,339 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:21:41,363 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 11:21:41,364 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:21:41,509 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_64d13445-3e80-4b1b-8ccf-b69ab334ebfc/bin/utaipan/witness.graphml [2019-10-22 11:21:41,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:41,511 INFO L168 Benchmark]: Toolchain (without parser) took 10806.53 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 364.9 MB). Free memory was 935.7 MB in the beginning and 926.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 374.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:41,511 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:41,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 640.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:41,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.87 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:41,512 INFO L168 Benchmark]: Boogie Preprocessor took 73.11 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:41,512 INFO L168 Benchmark]: RCFGBuilder took 971.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 114.7 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:41,513 INFO L168 Benchmark]: TraceAbstraction took 8875.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.2 MB). Free memory was 1.0 GB in the beginning and 939.1 MB in the end (delta: 68.0 MB). Peak memory consumption was 277.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:41,513 INFO L168 Benchmark]: Witness Printer took 174.52 ms. Allocated memory is still 1.4 GB. Free memory was 939.1 MB in the beginning and 926.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:41,515 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 640.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.87 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.11 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 971.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 114.7 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8875.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.2 MB). Free memory was 1.0 GB in the beginning and 939.1 MB in the end (delta: 68.0 MB). Peak memory consumption was 277.2 MB. Max. memory is 11.5 GB. * Witness Printer took 174.52 ms. Allocated memory is still 1.4 GB. Free memory was 939.1 MB in the beginning and 926.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 527]: 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 && a17 <= 0) && a20 == 1) || (((1 == a7 && a17 == 1) && a20 == 1) && a16 == 5)) || a16 <= 4) || (14 <= a8 && 5 == a16)) || 15 == a8) || ((1 == a7 && a17 == 1) && !(a16 == 6) && a21 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((14 <= a8 && a17 == 1) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && a17 <= 0) && a20 == 1) || (((1 == a7 && a17 == 1) && a20 == 1) && a16 == 5)) || a16 <= 4) || (14 <= a8 && 5 == a16)) || 15 == a8) || ((1 == a7 && a17 == 1) && !(a16 == 6) && a21 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((14 <= a8 && a17 == 1) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 8.7s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 711 SDtfs, 1931 SDslu, 96 SDs, 0 SdLazy, 4815 SolverSat, 749 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1002 GetRequests, 967 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2493occurred in iteration=8, 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, 10 MinimizatonAttempts, 1577 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 53 NumberOfFragments, 145 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2515 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 318 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2083 NumberOfCodeBlocks, 2083 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2550 ConstructedInterpolants, 0 QuantifiedInterpolants, 1088309 SizeOfPredicates, 2 NumberOfNonLiveVariables, 799 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 1384/1520 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...