./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14021e9fff9123a734a262a9d34c71e4922bd817 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:04:49,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:04:49,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:04:49,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:04:49,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:04:49,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:04:49,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:04:49,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:04:49,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:04:49,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:04:49,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:04:49,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:04:49,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:04:49,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:04:49,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:04:49,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:04:49,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:04:49,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:04:49,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:04:49,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:04:49,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:04:49,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:04:49,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:04:49,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:04:49,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:04:49,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:04:49,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:04:49,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:04:49,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:04:49,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:04:49,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:04:49,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:04:49,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:04:49,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:04:49,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:04:49,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:04:49,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:04:49,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:04:49,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:04:49,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:04:49,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:04:49,794 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:04:49,803 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:04:49,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:04:49,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:04:49,804 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:04:49,805 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:04:49,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:04:49,805 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:04:49,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:04:49,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:04:49,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:04:49,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:04:49,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:04:49,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:04:49,806 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:04:49,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:04:49,806 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:04:49,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:04:49,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:04:49,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:04:49,807 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:04:49,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:04:49,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:04:49,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:04:49,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:04:49,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:04:49,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:04:49,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:04:49,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:04:49,808 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:04:49,808 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14021e9fff9123a734a262a9d34c71e4922bd817 [2019-12-07 12:04:49,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:04:49,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:04:49,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:04:49,920 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:04:49,920 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:04:49,920 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label02.c [2019-12-07 12:04:49,958 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer/data/b17e291f4/a16efa9682a548cea63688310ef9114f/FLAG160d9d281 [2019-12-07 12:04:50,446 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:04:50,446 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/sv-benchmarks/c/eca-rers2012/Problem03_label02.c [2019-12-07 12:04:50,458 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer/data/b17e291f4/a16efa9682a548cea63688310ef9114f/FLAG160d9d281 [2019-12-07 12:04:50,467 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer/data/b17e291f4/a16efa9682a548cea63688310ef9114f [2019-12-07 12:04:50,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:04:50,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:04:50,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:04:50,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:04:50,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:04:50,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:04:50" (1/1) ... [2019-12-07 12:04:50,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@449728aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:50, skipping insertion in model container [2019-12-07 12:04:50,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:04:50" (1/1) ... [2019-12-07 12:04:50,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:04:50,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:04:50,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:04:50,928 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:04:51,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:04:51,094 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:04:51,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:51 WrapperNode [2019-12-07 12:04:51,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:04:51,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:04:51,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:04:51,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:04:51,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:51" (1/1) ... [2019-12-07 12:04:51,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:51" (1/1) ... [2019-12-07 12:04:51,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:04:51,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:04:51,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:04:51,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:04:51,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:51" (1/1) ... [2019-12-07 12:04:51,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:51" (1/1) ... [2019-12-07 12:04:51,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:51" (1/1) ... [2019-12-07 12:04:51,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:51" (1/1) ... [2019-12-07 12:04:51,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:51" (1/1) ... [2019-12-07 12:04:51,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:51" (1/1) ... [2019-12-07 12:04:51,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:51" (1/1) ... [2019-12-07 12:04:51,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:04:51,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:04:51,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:04:51,258 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:04:51,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:04:51,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:04:51,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:04:52,514 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:04:52,514 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 12:04:52,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:04:52 BoogieIcfgContainer [2019-12-07 12:04:52,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:04:52,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:04:52,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:04:52,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:04:52,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:04:50" (1/3) ... [2019-12-07 12:04:52,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9ea465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:04:52, skipping insertion in model container [2019-12-07 12:04:52,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:51" (2/3) ... [2019-12-07 12:04:52,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9ea465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:04:52, skipping insertion in model container [2019-12-07 12:04:52,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:04:52" (3/3) ... [2019-12-07 12:04:52,520 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label02.c [2019-12-07 12:04:52,527 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:04:52,532 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:04:52,540 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:04:52,560 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:04:52,560 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:04:52,560 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:04:52,560 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:04:52,560 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:04:52,560 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:04:52,560 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:04:52,561 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:04:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-12-07 12:04:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-12-07 12:04:52,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:52,591 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:52,592 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash -635106638, now seen corresponding path program 1 times [2019-12-07 12:04:52,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:52,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571809755] [2019-12-07 12:04:52,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:53,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571809755] [2019-12-07 12:04:53,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:53,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:53,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121973814] [2019-12-07 12:04:53,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:04:53,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:53,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:04:53,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:53,039 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-12-07 12:04:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:54,276 INFO L93 Difference]: Finished difference Result 1075 states and 1929 transitions. [2019-12-07 12:04:54,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:04:54,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-12-07 12:04:54,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:54,292 INFO L225 Difference]: With dead ends: 1075 [2019-12-07 12:04:54,292 INFO L226 Difference]: Without dead ends: 677 [2019-12-07 12:04:54,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:54,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-12-07 12:04:54,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 451. [2019-12-07 12:04:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-12-07 12:04:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 700 transitions. [2019-12-07 12:04:54,345 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 700 transitions. Word has length 204 [2019-12-07 12:04:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:54,346 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 700 transitions. [2019-12-07 12:04:54,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:04:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 700 transitions. [2019-12-07 12:04:54,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-12-07 12:04:54,350 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:54,351 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:54,351 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:54,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:54,351 INFO L82 PathProgramCache]: Analyzing trace with hash 317780433, now seen corresponding path program 1 times [2019-12-07 12:04:54,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:54,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562819914] [2019-12-07 12:04:54,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:54,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562819914] [2019-12-07 12:04:54,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:54,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:04:54,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43010413] [2019-12-07 12:04:54,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:04:54,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:54,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:04:54,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:54,462 INFO L87 Difference]: Start difference. First operand 451 states and 700 transitions. Second operand 3 states. [2019-12-07 12:04:55,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:55,077 INFO L93 Difference]: Finished difference Result 1323 states and 2069 transitions. [2019-12-07 12:04:55,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:04:55,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-12-07 12:04:55,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:55,081 INFO L225 Difference]: With dead ends: 1323 [2019-12-07 12:04:55,081 INFO L226 Difference]: Without dead ends: 874 [2019-12-07 12:04:55,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-12-07 12:04:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 859. [2019-12-07 12:04:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-12-07 12:04:55,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1315 transitions. [2019-12-07 12:04:55,104 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1315 transitions. Word has length 212 [2019-12-07 12:04:55,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:55,104 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1315 transitions. [2019-12-07 12:04:55,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:04:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1315 transitions. [2019-12-07 12:04:55,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-07 12:04:55,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:55,109 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:55,109 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:55,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:55,109 INFO L82 PathProgramCache]: Analyzing trace with hash 395983086, now seen corresponding path program 1 times [2019-12-07 12:04:55,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:55,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800533843] [2019-12-07 12:04:55,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:55,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800533843] [2019-12-07 12:04:55,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:55,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:04:55,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085637897] [2019-12-07 12:04:55,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:04:55,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:55,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:04:55,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:55,167 INFO L87 Difference]: Start difference. First operand 859 states and 1315 transitions. Second operand 3 states. [2019-12-07 12:04:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:55,511 INFO L93 Difference]: Finished difference Result 1695 states and 2599 transitions. [2019-12-07 12:04:55,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:04:55,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-12-07 12:04:55,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:55,516 INFO L225 Difference]: With dead ends: 1695 [2019-12-07 12:04:55,516 INFO L226 Difference]: Without dead ends: 838 [2019-12-07 12:04:55,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-12-07 12:04:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-12-07 12:04:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-12-07 12:04:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1236 transitions. [2019-12-07 12:04:55,538 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1236 transitions. Word has length 217 [2019-12-07 12:04:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:55,538 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1236 transitions. [2019-12-07 12:04:55,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:04:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1236 transitions. [2019-12-07 12:04:55,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-12-07 12:04:55,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:55,543 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:55,543 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:55,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:55,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1769273276, now seen corresponding path program 1 times [2019-12-07 12:04:55,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:55,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760991658] [2019-12-07 12:04:55,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:55,600 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 12:04:55,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760991658] [2019-12-07 12:04:55,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:55,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:55,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516020096] [2019-12-07 12:04:55,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:04:55,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:55,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:04:55,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:55,602 INFO L87 Difference]: Start difference. First operand 838 states and 1236 transitions. Second operand 4 states. [2019-12-07 12:04:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:56,660 INFO L93 Difference]: Finished difference Result 3311 states and 4893 transitions. [2019-12-07 12:04:56,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:04:56,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-12-07 12:04:56,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:56,672 INFO L225 Difference]: With dead ends: 3311 [2019-12-07 12:04:56,672 INFO L226 Difference]: Without dead ends: 2475 [2019-12-07 12:04:56,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:56,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2019-12-07 12:04:56,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 1655. [2019-12-07 12:04:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-12-07 12:04:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2336 transitions. [2019-12-07 12:04:56,703 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2336 transitions. Word has length 218 [2019-12-07 12:04:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:56,703 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 2336 transitions. [2019-12-07 12:04:56,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:04:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2336 transitions. [2019-12-07 12:04:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-12-07 12:04:56,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:56,706 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:56,707 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:56,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:56,707 INFO L82 PathProgramCache]: Analyzing trace with hash -73934984, now seen corresponding path program 1 times [2019-12-07 12:04:56,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:56,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198881667] [2019-12-07 12:04:56,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 12:04:56,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198881667] [2019-12-07 12:04:56,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:56,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:04:56,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643095714] [2019-12-07 12:04:56,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:04:56,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:56,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:04:56,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:56,774 INFO L87 Difference]: Start difference. First operand 1655 states and 2336 transitions. Second operand 3 states. [2019-12-07 12:04:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:57,065 INFO L93 Difference]: Finished difference Result 4955 states and 6996 transitions. [2019-12-07 12:04:57,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:04:57,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-12-07 12:04:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:57,078 INFO L225 Difference]: With dead ends: 4955 [2019-12-07 12:04:57,078 INFO L226 Difference]: Without dead ends: 3302 [2019-12-07 12:04:57,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2019-12-07 12:04:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 3300. [2019-12-07 12:04:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3300 states. [2019-12-07 12:04:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 4655 transitions. [2019-12-07 12:04:57,128 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 4655 transitions. Word has length 224 [2019-12-07 12:04:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:57,128 INFO L462 AbstractCegarLoop]: Abstraction has 3300 states and 4655 transitions. [2019-12-07 12:04:57,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:04:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 4655 transitions. [2019-12-07 12:04:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-12-07 12:04:57,132 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:57,132 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:57,132 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:57,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:57,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1732733814, now seen corresponding path program 1 times [2019-12-07 12:04:57,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:57,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283675988] [2019-12-07 12:04:57,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:57,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283675988] [2019-12-07 12:04:57,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:57,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:04:57,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453887570] [2019-12-07 12:04:57,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:04:57,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:57,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:04:57,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:57,235 INFO L87 Difference]: Start difference. First operand 3300 states and 4655 transitions. Second operand 5 states. [2019-12-07 12:04:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:58,640 INFO L93 Difference]: Finished difference Result 7633 states and 10834 transitions. [2019-12-07 12:04:58,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:04:58,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 242 [2019-12-07 12:04:58,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:58,662 INFO L225 Difference]: With dead ends: 7633 [2019-12-07 12:04:58,662 INFO L226 Difference]: Without dead ends: 4335 [2019-12-07 12:04:58,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:58,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4335 states. [2019-12-07 12:04:58,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4335 to 3503. [2019-12-07 12:04:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2019-12-07 12:04:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 4897 transitions. [2019-12-07 12:04:58,720 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 4897 transitions. Word has length 242 [2019-12-07 12:04:58,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:58,721 INFO L462 AbstractCegarLoop]: Abstraction has 3503 states and 4897 transitions. [2019-12-07 12:04:58,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:04:58,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 4897 transitions. [2019-12-07 12:04:58,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-12-07 12:04:58,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:58,725 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:58,725 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:58,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:58,725 INFO L82 PathProgramCache]: Analyzing trace with hash -177417023, now seen corresponding path program 1 times [2019-12-07 12:04:58,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:58,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525745601] [2019-12-07 12:04:58,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:58,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525745601] [2019-12-07 12:04:58,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:58,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:04:58,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616652367] [2019-12-07 12:04:58,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:04:58,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:58,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:04:58,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:58,822 INFO L87 Difference]: Start difference. First operand 3503 states and 4897 transitions. Second operand 3 states. [2019-12-07 12:04:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:59,457 INFO L93 Difference]: Finished difference Result 8651 states and 12071 transitions. [2019-12-07 12:04:59,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:04:59,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-12-07 12:04:59,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:59,476 INFO L225 Difference]: With dead ends: 8651 [2019-12-07 12:04:59,476 INFO L226 Difference]: Without dead ends: 5150 [2019-12-07 12:04:59,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5150 states. [2019-12-07 12:04:59,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5150 to 5148. [2019-12-07 12:04:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5148 states. [2019-12-07 12:04:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 7124 transitions. [2019-12-07 12:04:59,553 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 7124 transitions. Word has length 245 [2019-12-07 12:04:59,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:59,553 INFO L462 AbstractCegarLoop]: Abstraction has 5148 states and 7124 transitions. [2019-12-07 12:04:59,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:04:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 7124 transitions. [2019-12-07 12:04:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-12-07 12:04:59,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:59,560 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:59,560 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:59,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:59,560 INFO L82 PathProgramCache]: Analyzing trace with hash -285299978, now seen corresponding path program 1 times [2019-12-07 12:04:59,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:59,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962679851] [2019-12-07 12:04:59,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:59,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962679851] [2019-12-07 12:04:59,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862648806] [2019-12-07 12:04:59,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer/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-12-07 12:04:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:59,826 INFO L264 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:04:59,840 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:04:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 12:04:59,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:04:59,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-12-07 12:04:59,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107077656] [2019-12-07 12:04:59,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:04:59,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:59,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:04:59,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:04:59,916 INFO L87 Difference]: Start difference. First operand 5148 states and 7124 transitions. Second operand 3 states. [2019-12-07 12:05:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:05:00,621 INFO L93 Difference]: Finished difference Result 14966 states and 20735 transitions. [2019-12-07 12:05:00,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:05:00,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-12-07 12:05:00,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:05:00,666 INFO L225 Difference]: With dead ends: 14966 [2019-12-07 12:05:00,667 INFO L226 Difference]: Without dead ends: 9820 [2019-12-07 12:05:00,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:05:00,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9820 states. [2019-12-07 12:05:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9820 to 9817. [2019-12-07 12:05:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9817 states. [2019-12-07 12:05:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9817 states to 9817 states and 13584 transitions. [2019-12-07 12:05:00,818 INFO L78 Accepts]: Start accepts. Automaton has 9817 states and 13584 transitions. Word has length 252 [2019-12-07 12:05:00,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:05:00,818 INFO L462 AbstractCegarLoop]: Abstraction has 9817 states and 13584 transitions. [2019-12-07 12:05:00,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:05:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 9817 states and 13584 transitions. [2019-12-07 12:05:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-12-07 12:05:00,829 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:05:00,830 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:05:01,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:05:01,031 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:05:01,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:05:01,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1508910405, now seen corresponding path program 1 times [2019-12-07 12:05:01,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:05:01,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326673470] [2019-12-07 12:05:01,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:05:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:01,103 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-12-07 12:05:01,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326673470] [2019-12-07 12:05:01,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:05:01,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:05:01,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955043535] [2019-12-07 12:05:01,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:05:01,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:05:01,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:05:01,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:05:01,105 INFO L87 Difference]: Start difference. First operand 9817 states and 13584 transitions. Second operand 3 states. [2019-12-07 12:05:01,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:05:01,781 INFO L93 Difference]: Finished difference Result 27349 states and 37743 transitions. [2019-12-07 12:05:01,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:05:01,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-12-07 12:05:01,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:05:01,811 INFO L225 Difference]: With dead ends: 27349 [2019-12-07 12:05:01,811 INFO L226 Difference]: Without dead ends: 17534 [2019-12-07 12:05:01,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:05:01,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17534 states. [2019-12-07 12:05:01,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17534 to 17532. [2019-12-07 12:05:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-12-07 12:05:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 22681 transitions. [2019-12-07 12:05:01,967 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 22681 transitions. Word has length 279 [2019-12-07 12:05:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:05:01,968 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 22681 transitions. [2019-12-07 12:05:01,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:05:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 22681 transitions. [2019-12-07 12:05:01,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-12-07 12:05:01,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:05:01,987 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:05:01,987 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:05:01,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:05:01,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1279960778, now seen corresponding path program 1 times [2019-12-07 12:05:01,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:05:01,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122782408] [2019-12-07 12:05:01,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:05:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:02,062 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-12-07 12:05:02,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122782408] [2019-12-07 12:05:02,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:05:02,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:05:02,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664003551] [2019-12-07 12:05:02,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:05:02,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:05:02,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:05:02,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:05:02,064 INFO L87 Difference]: Start difference. First operand 17532 states and 22681 transitions. Second operand 3 states. [2019-12-07 12:05:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:05:03,221 INFO L93 Difference]: Finished difference Result 35066 states and 45367 transitions. [2019-12-07 12:05:03,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:05:03,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-12-07 12:05:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:05:03,247 INFO L225 Difference]: With dead ends: 35066 [2019-12-07 12:05:03,247 INFO L226 Difference]: Without dead ends: 17536 [2019-12-07 12:05:03,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:05:03,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17536 states. [2019-12-07 12:05:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17536 to 17532. [2019-12-07 12:05:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-12-07 12:05:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 20680 transitions. [2019-12-07 12:05:03,399 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 20680 transitions. Word has length 281 [2019-12-07 12:05:03,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:05:03,400 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 20680 transitions. [2019-12-07 12:05:03,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:05:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 20680 transitions. [2019-12-07 12:05:03,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-12-07 12:05:03,423 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:05:03,423 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:05:03,424 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:05:03,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:05:03,424 INFO L82 PathProgramCache]: Analyzing trace with hash 166387689, now seen corresponding path program 1 times [2019-12-07 12:05:03,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:05:03,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303661644] [2019-12-07 12:05:03,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:05:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-12-07 12:05:03,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303661644] [2019-12-07 12:05:03,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:05:03,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:05:03,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296965994] [2019-12-07 12:05:03,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:05:03,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:05:03,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:05:03,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:05:03,571 INFO L87 Difference]: Start difference. First operand 17532 states and 20680 transitions. Second operand 4 states. [2019-12-07 12:05:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:05:04,332 INFO L93 Difference]: Finished difference Result 35064 states and 41362 transitions. [2019-12-07 12:05:04,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:05:04,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 299 [2019-12-07 12:05:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:05:04,346 INFO L225 Difference]: With dead ends: 35064 [2019-12-07 12:05:04,346 INFO L226 Difference]: Without dead ends: 17534 [2019-12-07 12:05:04,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:05:04,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17534 states. [2019-12-07 12:05:04,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17534 to 17532. [2019-12-07 12:05:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-12-07 12:05:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 20168 transitions. [2019-12-07 12:05:04,481 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 20168 transitions. Word has length 299 [2019-12-07 12:05:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:05:04,482 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 20168 transitions. [2019-12-07 12:05:04,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:05:04,482 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 20168 transitions. [2019-12-07 12:05:04,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-12-07 12:05:04,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:05:04,497 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:05:04,497 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:05:04,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:05:04,498 INFO L82 PathProgramCache]: Analyzing trace with hash 319416056, now seen corresponding path program 1 times [2019-12-07 12:05:04,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:05:04,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698406018] [2019-12-07 12:05:04,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:05:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-12-07 12:05:04,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698406018] [2019-12-07 12:05:04,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598829268] [2019-12-07 12:05:04,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer/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-12-07 12:05:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:04,753 INFO L264 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:05:04,760 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:05:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 12:05:04,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:05:04,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-12-07 12:05:04,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419197624] [2019-12-07 12:05:04,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:05:04,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:05:04,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:05:04,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:05:04,814 INFO L87 Difference]: Start difference. First operand 17532 states and 20168 transitions. Second operand 3 states. [2019-12-07 12:05:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:05:05,412 INFO L93 Difference]: Finished difference Result 34660 states and 39896 transitions. [2019-12-07 12:05:05,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:05:05,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-12-07 12:05:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:05:05,426 INFO L225 Difference]: With dead ends: 34660 [2019-12-07 12:05:05,426 INFO L226 Difference]: Without dead ends: 17130 [2019-12-07 12:05:05,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:05:05,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17130 states. [2019-12-07 12:05:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17130 to 16314. [2019-12-07 12:05:05,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16314 states. [2019-12-07 12:05:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16314 states to 16314 states and 18372 transitions. [2019-12-07 12:05:05,545 INFO L78 Accepts]: Start accepts. Automaton has 16314 states and 18372 transitions. Word has length 305 [2019-12-07 12:05:05,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:05:05,545 INFO L462 AbstractCegarLoop]: Abstraction has 16314 states and 18372 transitions. [2019-12-07 12:05:05,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:05:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 16314 states and 18372 transitions. [2019-12-07 12:05:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-12-07 12:05:05,556 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:05:05,556 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:05:05,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:05:05,758 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:05:05,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:05:05,759 INFO L82 PathProgramCache]: Analyzing trace with hash 319777275, now seen corresponding path program 1 times [2019-12-07 12:05:05,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:05:05,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968884274] [2019-12-07 12:05:05,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:05:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:05,913 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 142 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-12-07 12:05:05,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968884274] [2019-12-07 12:05:05,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149337706] [2019-12-07 12:05:05,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:05:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:06,046 INFO L264 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:05:06,051 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:05:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 12:05:06,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:05:06,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-12-07 12:05:06,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495829543] [2019-12-07 12:05:06,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:05:06,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:05:06,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:05:06,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:05:06,118 INFO L87 Difference]: Start difference. First operand 16314 states and 18372 transitions. Second operand 3 states. [2019-12-07 12:05:06,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:05:06,413 INFO L93 Difference]: Finished difference Result 47676 states and 53654 transitions. [2019-12-07 12:05:06,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:05:06,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-12-07 12:05:06,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:05:06,434 INFO L225 Difference]: With dead ends: 47676 [2019-12-07 12:05:06,434 INFO L226 Difference]: Without dead ends: 31364 [2019-12-07 12:05:06,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 333 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:05:06,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31364 states. [2019-12-07 12:05:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31364 to 31362. [2019-12-07 12:05:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31362 states. [2019-12-07 12:05:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31362 states to 31362 states and 35269 transitions. [2019-12-07 12:05:06,689 INFO L78 Accepts]: Start accepts. Automaton has 31362 states and 35269 transitions. Word has length 334 [2019-12-07 12:05:06,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:05:06,690 INFO L462 AbstractCegarLoop]: Abstraction has 31362 states and 35269 transitions. [2019-12-07 12:05:06,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:05:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand 31362 states and 35269 transitions. [2019-12-07 12:05:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-12-07 12:05:06,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:05:06,717 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:05:06,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:05:06,918 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:05:06,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:05:06,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1227130941, now seen corresponding path program 1 times [2019-12-07 12:05:06,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:05:06,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721286186] [2019-12-07 12:05:06,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:05:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-12-07 12:05:07,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721286186] [2019-12-07 12:05:07,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:05:07,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:05:07,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432344787] [2019-12-07 12:05:07,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:05:07,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:05:07,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:05:07,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:05:07,164 INFO L87 Difference]: Start difference. First operand 31362 states and 35269 transitions. Second operand 3 states. [2019-12-07 12:05:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:05:07,529 INFO L93 Difference]: Finished difference Result 91421 states and 102843 transitions. [2019-12-07 12:05:07,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:05:07,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 402 [2019-12-07 12:05:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:05:07,576 INFO L225 Difference]: With dead ends: 91421 [2019-12-07 12:05:07,576 INFO L226 Difference]: Without dead ends: 60061 [2019-12-07 12:05:07,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:05:07,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60061 states. [2019-12-07 12:05:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60061 to 60059. [2019-12-07 12:05:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60059 states. [2019-12-07 12:05:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60059 states to 60059 states and 67560 transitions. [2019-12-07 12:05:08,075 INFO L78 Accepts]: Start accepts. Automaton has 60059 states and 67560 transitions. Word has length 402 [2019-12-07 12:05:08,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:05:08,075 INFO L462 AbstractCegarLoop]: Abstraction has 60059 states and 67560 transitions. [2019-12-07 12:05:08,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:05:08,076 INFO L276 IsEmpty]: Start isEmpty. Operand 60059 states and 67560 transitions. [2019-12-07 12:05:08,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-12-07 12:05:08,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:05:08,108 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 12:05:08,108 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:05:08,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:05:08,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1835984863, now seen corresponding path program 1 times [2019-12-07 12:05:08,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:05:08,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285643964] [2019-12-07 12:05:08,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:05:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 12:05:08,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285643964] [2019-12-07 12:05:08,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:05:08,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:05:08,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718116976] [2019-12-07 12:05:08,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:05:08,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:05:08,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:05:08,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:05:08,333 INFO L87 Difference]: Start difference. First operand 60059 states and 67560 transitions. Second operand 3 states. [2019-12-07 12:05:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:05:08,783 INFO L93 Difference]: Finished difference Result 170158 states and 191231 transitions. [2019-12-07 12:05:08,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:05:08,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 406 [2019-12-07 12:05:08,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:05:08,878 INFO L225 Difference]: With dead ends: 170158 [2019-12-07 12:05:08,878 INFO L226 Difference]: Without dead ends: 110101 [2019-12-07 12:05:08,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:05:08,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110101 states. [2019-12-07 12:05:09,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110101 to 110099. [2019-12-07 12:05:09,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110099 states. [2019-12-07 12:05:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110099 states to 110099 states and 123037 transitions. [2019-12-07 12:05:10,049 INFO L78 Accepts]: Start accepts. Automaton has 110099 states and 123037 transitions. Word has length 406 [2019-12-07 12:05:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:05:10,049 INFO L462 AbstractCegarLoop]: Abstraction has 110099 states and 123037 transitions. [2019-12-07 12:05:10,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:05:10,049 INFO L276 IsEmpty]: Start isEmpty. Operand 110099 states and 123037 transitions. [2019-12-07 12:05:10,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-12-07 12:05:10,097 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:05:10,098 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:05:10,098 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:05:10,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:05:10,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1939314004, now seen corresponding path program 1 times [2019-12-07 12:05:10,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:05:10,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467251578] [2019-12-07 12:05:10,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:05:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:10,278 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 12:05:10,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467251578] [2019-12-07 12:05:10,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:05:10,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:05:10,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302686905] [2019-12-07 12:05:10,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:05:10,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:05:10,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:05:10,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:05:10,279 INFO L87 Difference]: Start difference. First operand 110099 states and 123037 transitions. Second operand 3 states. [2019-12-07 12:05:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:05:11,046 INFO L93 Difference]: Finished difference Result 279372 states and 311596 transitions. [2019-12-07 12:05:11,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:05:11,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 408 [2019-12-07 12:05:11,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:05:11,189 INFO L225 Difference]: With dead ends: 279372 [2019-12-07 12:05:11,189 INFO L226 Difference]: Without dead ends: 169275 [2019-12-07 12:05:11,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:05:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169275 states. [2019-12-07 12:05:12,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169275 to 169273. [2019-12-07 12:05:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169273 states. [2019-12-07 12:05:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169273 states to 169273 states and 188538 transitions. [2019-12-07 12:05:12,886 INFO L78 Accepts]: Start accepts. Automaton has 169273 states and 188538 transitions. Word has length 408 [2019-12-07 12:05:12,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:05:12,886 INFO L462 AbstractCegarLoop]: Abstraction has 169273 states and 188538 transitions. [2019-12-07 12:05:12,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:05:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 169273 states and 188538 transitions. [2019-12-07 12:05:12,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-12-07 12:05:12,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:05:12,973 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:05:12,973 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:05:12,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:05:12,974 INFO L82 PathProgramCache]: Analyzing trace with hash 20202666, now seen corresponding path program 1 times [2019-12-07 12:05:12,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:05:12,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613707491] [2019-12-07 12:05:12,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:05:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-12-07 12:05:13,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613707491] [2019-12-07 12:05:13,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:05:13,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:05:13,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754553227] [2019-12-07 12:05:13,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:05:13,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:05:13,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:05:13,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:05:13,099 INFO L87 Difference]: Start difference. First operand 169273 states and 188538 transitions. Second operand 4 states. [2019-12-07 12:05:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:05:14,826 INFO L93 Difference]: Finished difference Result 365751 states and 409365 transitions. [2019-12-07 12:05:14,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:05:14,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 420 [2019-12-07 12:05:14,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:05:15,003 INFO L225 Difference]: With dead ends: 365751 [2019-12-07 12:05:15,003 INFO L226 Difference]: Without dead ends: 196480 [2019-12-07 12:05:15,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:05:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196480 states. [2019-12-07 12:05:18,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196480 to 196456. [2019-12-07 12:05:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196456 states. [2019-12-07 12:05:18,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196456 states to 196456 states and 215216 transitions. [2019-12-07 12:05:18,271 INFO L78 Accepts]: Start accepts. Automaton has 196456 states and 215216 transitions. Word has length 420 [2019-12-07 12:05:18,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:05:18,272 INFO L462 AbstractCegarLoop]: Abstraction has 196456 states and 215216 transitions. [2019-12-07 12:05:18,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:05:18,272 INFO L276 IsEmpty]: Start isEmpty. Operand 196456 states and 215216 transitions. [2019-12-07 12:05:18,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-12-07 12:05:18,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:05:18,334 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:05:18,334 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:05:18,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:05:18,334 INFO L82 PathProgramCache]: Analyzing trace with hash -2075258228, now seen corresponding path program 1 times [2019-12-07 12:05:18,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:05:18,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197231552] [2019-12-07 12:05:18,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:05:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-12-07 12:05:18,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197231552] [2019-12-07 12:05:18,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:05:18,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:05:18,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622647586] [2019-12-07 12:05:18,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:05:18,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:05:18,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:05:18,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:05:18,543 INFO L87 Difference]: Start difference. First operand 196456 states and 215216 transitions. Second operand 3 states. [2019-12-07 12:05:20,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:05:20,100 INFO L93 Difference]: Finished difference Result 390297 states and 427717 transitions. [2019-12-07 12:05:20,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:05:20,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-12-07 12:05:20,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:05:20,280 INFO L225 Difference]: With dead ends: 390297 [2019-12-07 12:05:20,280 INFO L226 Difference]: Without dead ends: 193843 [2019-12-07 12:05:20,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:05:20,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193843 states. [2019-12-07 12:05:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193843 to 190366. [2019-12-07 12:05:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190366 states. [2019-12-07 12:05:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190366 states to 190366 states and 206912 transitions. [2019-12-07 12:05:22,289 INFO L78 Accepts]: Start accepts. Automaton has 190366 states and 206912 transitions. Word has length 469 [2019-12-07 12:05:22,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:05:22,290 INFO L462 AbstractCegarLoop]: Abstraction has 190366 states and 206912 transitions. [2019-12-07 12:05:22,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:05:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 190366 states and 206912 transitions. [2019-12-07 12:05:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-12-07 12:05:22,347 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:05:22,348 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 12:05:22,348 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:05:22,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:05:22,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1215708500, now seen corresponding path program 1 times [2019-12-07 12:05:22,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:05:22,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203187993] [2019-12-07 12:05:22,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:05:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-12-07 12:05:22,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203187993] [2019-12-07 12:05:22,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:05:22,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:05:22,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560810895] [2019-12-07 12:05:22,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:05:22,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:05:22,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:05:22,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:05:22,638 INFO L87 Difference]: Start difference. First operand 190366 states and 206912 transitions. Second operand 3 states. [2019-12-07 12:05:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:05:24,095 INFO L93 Difference]: Finished difference Result 401497 states and 437034 transitions. [2019-12-07 12:05:24,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:05:24,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 484 [2019-12-07 12:05:24,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:05:24,096 INFO L225 Difference]: With dead ends: 401497 [2019-12-07 12:05:24,096 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:05:24,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:05:24,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:05:24,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:05:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:05:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:05:24,166 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 484 [2019-12-07 12:05:24,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:05:24,166 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:05:24,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:05:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:05:24,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:05:24,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:05:29,421 WARN L192 SmtUtils]: Spent 5.24 s on a formula simplification. DAG size of input: 1075 DAG size of output: 481 [2019-12-07 12:05:34,253 WARN L192 SmtUtils]: Spent 4.83 s on a formula simplification. DAG size of input: 1075 DAG size of output: 481 [2019-12-07 12:05:38,747 WARN L192 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 476 DAG size of output: 100 [2019-12-07 12:05:43,237 WARN L192 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 476 DAG size of output: 100 [2019-12-07 12:05:43,240 INFO L246 CegarLoopResult]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-12-07 12:05:43,240 INFO L246 CegarLoopResult]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-12-07 12:05:43,240 INFO L246 CegarLoopResult]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,240 INFO L246 CegarLoopResult]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,240 INFO L246 CegarLoopResult]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,240 INFO L246 CegarLoopResult]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,240 INFO L246 CegarLoopResult]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,240 INFO L246 CegarLoopResult]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,240 INFO L246 CegarLoopResult]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,240 INFO L246 CegarLoopResult]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-12-07 12:05:43,240 INFO L246 CegarLoopResult]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-12-07 12:05:43,241 INFO L246 CegarLoopResult]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,242 INFO L246 CegarLoopResult]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-12-07 12:05:43,243 INFO L246 CegarLoopResult]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,244 INFO L246 CegarLoopResult]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,245 INFO L246 CegarLoopResult]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,246 INFO L246 CegarLoopResult]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,247 INFO L246 CegarLoopResult]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,247 INFO L242 CegarLoopResult]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse13 (= 1 ~a6~0)) (.cse2 (= ~a12~0 1)) (.cse9 (= ~a27~0 1))) (let ((.cse17 (= 1 ~a8~0)) (.cse7 (<= ~a3~0 0)) (.cse11 (= 1 ~a0~0)) (.cse0 (= 1 ~a3~0)) (.cse16 (not .cse9)) (.cse3 (= ~a11~0 1)) (.cse14 (= ~a16~0 1)) (.cse6 (= 1 ~a4~0)) (.cse15 (<= 1 ~a3~0)) (.cse1 (= 1 ~a5~0)) (.cse10 (not .cse2)) (.cse8 (<= ~a11~0 0)) (.cse4 (not .cse13)) (.cse5 (= ~a26~0 1)) (.cse12 (= ~a15~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse6) (and .cse9 .cse1 .cse10 .cse8 .cse4 .cse11) (and .cse7 .cse9 .cse1 .cse10 .cse4 .cse3 .cse12 .cse6) (and .cse1 .cse13 .cse10 .cse8 .cse11) (and .cse9 .cse1 .cse3 .cse5 .cse11 .cse14) (and .cse15 .cse1 .cse16 .cse10 .cse4 .cse3 .cse14 .cse12) (and .cse0 .cse9 .cse1 .cse10 .cse4 .cse3 .cse14) (and .cse9 .cse1 .cse10 .cse4 .cse3 .cse11) (and .cse15 .cse1 .cse2 .cse16 .cse4 .cse3 .cse14 .cse5 .cse6) (and .cse7 .cse1 .cse13 .cse16 .cse8 .cse11 .cse14) (and .cse9 .cse1 .cse8 .cse5 .cse12 .cse6) (and .cse7 .cse9 .cse1 .cse3 .cse5 .cse14 .cse12) (and .cse1 .cse13 .cse16 .cse8 .cse11 .cse14 .cse6) (and .cse7 .cse1 .cse13 .cse10 .cse8 .cse14 .cse6) (and .cse15 .cse9 .cse1 .cse13 .cse2 .cse3 .cse14 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse7 .cse1 .cse13 .cse10 .cse8 .cse12 .cse6) (and .cse15 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse1 .cse10 .cse8 .cse4 .cse6) (and .cse0 .cse1 .cse10 .cse8 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse16 .cse17 .cse4 .cse3 .cse14 .cse5) (and .cse7 .cse9 .cse1 .cse3 .cse5 .cse11 .cse6) (and .cse15 .cse9 .cse1 .cse13 .cse8 .cse11) (and .cse7 .cse9 .cse1 .cse2 .cse8 .cse5 .cse14) (and .cse15 .cse1 .cse10 .cse3 .cse5 .cse11) (and .cse7 .cse1 .cse13 .cse3 .cse5 .cse11) (and .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6) (and .cse7 .cse1 .cse13 .cse10 .cse3 .cse14 .cse5 .cse6) (and .cse7 .cse1 .cse13 .cse16 .cse3 .cse5 .cse14 .cse12 .cse6) (and .cse7 .cse9 .cse1 .cse13 .cse10 .cse3) (and .cse15 .cse1 .cse10 .cse4 .cse3 .cse11) (and .cse1 .cse13 .cse10 .cse8 .cse5) (and .cse9 .cse1 .cse8 .cse5 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse8 .cse11 .cse6) (and .cse7 .cse1 .cse2 .cse8 .cse17 .cse4 .cse12) (and .cse1 .cse16 .cse10 .cse4 .cse3 .cse14 .cse5 .cse11 .cse12) (and .cse15 .cse1 .cse2 .cse8 .cse4 .cse5 .cse12) (and .cse15 .cse9 .cse1 .cse10 .cse4 .cse3 .cse5) (and .cse15 .cse1 .cse13 .cse10 .cse3 .cse5 .cse12) (and .cse0 .cse1 .cse13 .cse8 .cse5 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse5 .cse14) (and .cse15 .cse9 .cse1 .cse13 .cse8 .cse12 .cse6) (and .cse15 .cse9 .cse1 .cse8 .cse17 .cse11) (and .cse7 .cse9 .cse1 .cse13 .cse3 .cse11 .cse12) (and .cse9 .cse1 .cse8 .cse11 .cse5 .cse6) (and .cse1 .cse2 .cse16 .cse4 .cse3 .cse14 .cse5 .cse11 .cse6) (and .cse15 .cse1 .cse2 .cse8 .cse5 .cse11) (and .cse9 .cse0 .cse1 .cse10 .cse17 .cse3 .cse5) (and .cse7 .cse9 .cse1 .cse13 .cse3 .cse5 .cse12) (and .cse15 .cse9 .cse1 .cse13 .cse10 .cse8) (and .cse7 .cse9 .cse1 .cse10 .cse4 .cse3 .cse14 .cse6) (and .cse7 .cse9 .cse1 .cse3 .cse5 .cse12 .cse6) (and .cse0 .cse1 .cse10 .cse8 .cse4 .cse11) (and .cse7 .cse1 .cse2 .cse16 .cse8 .cse4 .cse14 .cse11) (and .cse0 .cse1 .cse13 .cse2 .cse16 .cse3 .cse14) (and .cse15 .cse1 .cse2 .cse8 .cse5 .cse12 .cse6) (and .cse15 .cse9 .cse1 .cse10 .cse8 .cse4 .cse5 .cse12)))) [2019-12-07 12:05:43,247 INFO L246 CegarLoopResult]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1647) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L249 CegarLoopResult]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,248 INFO L246 CegarLoopResult]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,249 INFO L246 CegarLoopResult]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,249 INFO L246 CegarLoopResult]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,249 INFO L246 CegarLoopResult]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,249 INFO L246 CegarLoopResult]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,249 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,249 INFO L246 CegarLoopResult]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,249 INFO L246 CegarLoopResult]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,249 INFO L246 CegarLoopResult]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-12-07 12:05:43,249 INFO L246 CegarLoopResult]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-12-07 12:05:43,249 INFO L246 CegarLoopResult]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,249 INFO L246 CegarLoopResult]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,249 INFO L246 CegarLoopResult]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-12-07 12:05:43,249 INFO L246 CegarLoopResult]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-12-07 12:05:43,249 INFO L246 CegarLoopResult]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L242 CegarLoopResult]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse13 (= 1 ~a6~0)) (.cse2 (= ~a12~0 1)) (.cse9 (= ~a27~0 1))) (let ((.cse17 (= 1 ~a8~0)) (.cse7 (<= ~a3~0 0)) (.cse11 (= 1 ~a0~0)) (.cse0 (= 1 ~a3~0)) (.cse16 (not .cse9)) (.cse3 (= ~a11~0 1)) (.cse14 (= ~a16~0 1)) (.cse6 (= 1 ~a4~0)) (.cse15 (<= 1 ~a3~0)) (.cse1 (= 1 ~a5~0)) (.cse10 (not .cse2)) (.cse8 (<= ~a11~0 0)) (.cse4 (not .cse13)) (.cse5 (= ~a26~0 1)) (.cse12 (= ~a15~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse6) (and .cse9 .cse1 .cse10 .cse8 .cse4 .cse11) (and .cse7 .cse9 .cse1 .cse10 .cse4 .cse3 .cse12 .cse6) (and .cse1 .cse13 .cse10 .cse8 .cse11) (and .cse9 .cse1 .cse3 .cse5 .cse11 .cse14) (and .cse15 .cse1 .cse16 .cse10 .cse4 .cse3 .cse14 .cse12) (and .cse0 .cse9 .cse1 .cse10 .cse4 .cse3 .cse14) (and .cse9 .cse1 .cse10 .cse4 .cse3 .cse11) (and .cse15 .cse1 .cse2 .cse16 .cse4 .cse3 .cse14 .cse5 .cse6) (and .cse7 .cse1 .cse13 .cse16 .cse8 .cse11 .cse14) (and .cse9 .cse1 .cse8 .cse5 .cse12 .cse6) (and .cse7 .cse9 .cse1 .cse3 .cse5 .cse14 .cse12) (and .cse1 .cse13 .cse16 .cse8 .cse11 .cse14 .cse6) (and .cse7 .cse1 .cse13 .cse10 .cse8 .cse14 .cse6) (and .cse15 .cse9 .cse1 .cse13 .cse2 .cse3 .cse14 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse7 .cse1 .cse13 .cse10 .cse8 .cse12 .cse6) (and .cse15 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse1 .cse10 .cse8 .cse4 .cse6) (and .cse0 .cse1 .cse10 .cse8 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse16 .cse17 .cse4 .cse3 .cse14 .cse5) (and .cse7 .cse9 .cse1 .cse3 .cse5 .cse11 .cse6) (and .cse15 .cse9 .cse1 .cse13 .cse8 .cse11) (and .cse7 .cse9 .cse1 .cse2 .cse8 .cse5 .cse14) (and .cse15 .cse1 .cse10 .cse3 .cse5 .cse11) (and .cse7 .cse1 .cse13 .cse3 .cse5 .cse11) (and .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6) (and .cse7 .cse1 .cse13 .cse10 .cse3 .cse14 .cse5 .cse6) (and .cse7 .cse1 .cse13 .cse16 .cse3 .cse5 .cse14 .cse12 .cse6) (and .cse7 .cse9 .cse1 .cse13 .cse10 .cse3) (and .cse15 .cse1 .cse10 .cse4 .cse3 .cse11) (and .cse1 .cse13 .cse10 .cse8 .cse5) (and .cse9 .cse1 .cse8 .cse5 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse8 .cse11 .cse6) (and .cse7 .cse1 .cse2 .cse8 .cse17 .cse4 .cse12) (and .cse1 .cse16 .cse10 .cse4 .cse3 .cse14 .cse5 .cse11 .cse12) (and .cse15 .cse1 .cse2 .cse8 .cse4 .cse5 .cse12) (and .cse15 .cse9 .cse1 .cse10 .cse4 .cse3 .cse5) (and .cse15 .cse1 .cse13 .cse10 .cse3 .cse5 .cse12) (and .cse0 .cse1 .cse13 .cse8 .cse5 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse5 .cse14) (and .cse15 .cse9 .cse1 .cse13 .cse8 .cse12 .cse6) (and .cse15 .cse9 .cse1 .cse8 .cse17 .cse11) (and .cse7 .cse9 .cse1 .cse13 .cse3 .cse11 .cse12) (and .cse9 .cse1 .cse8 .cse11 .cse5 .cse6) (and .cse1 .cse2 .cse16 .cse4 .cse3 .cse14 .cse5 .cse11 .cse6) (and .cse15 .cse1 .cse2 .cse8 .cse5 .cse11) (and .cse9 .cse0 .cse1 .cse10 .cse17 .cse3 .cse5) (and .cse7 .cse9 .cse1 .cse13 .cse3 .cse5 .cse12) (and .cse15 .cse9 .cse1 .cse13 .cse10 .cse8) (and .cse7 .cse9 .cse1 .cse10 .cse4 .cse3 .cse14 .cse6) (and .cse7 .cse9 .cse1 .cse3 .cse5 .cse12 .cse6) (and .cse0 .cse1 .cse10 .cse8 .cse4 .cse11) (and .cse7 .cse1 .cse2 .cse16 .cse8 .cse4 .cse14 .cse11) (and .cse0 .cse1 .cse13 .cse2 .cse16 .cse3 .cse14) (and .cse15 .cse1 .cse2 .cse8 .cse5 .cse12 .cse6) (and .cse15 .cse9 .cse1 .cse10 .cse8 .cse4 .cse5 .cse12)))) [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,250 INFO L246 CegarLoopResult]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,251 INFO L246 CegarLoopResult]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-12-07 12:05:43,252 INFO L246 CegarLoopResult]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-12-07 12:05:43,253 INFO L246 CegarLoopResult]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-12-07 12:05:43,254 INFO L246 CegarLoopResult]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,255 INFO L246 CegarLoopResult]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,256 INFO L246 CegarLoopResult]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:05:43,256 INFO L246 CegarLoopResult]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,256 INFO L246 CegarLoopResult]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-12-07 12:05:43,256 INFO L246 CegarLoopResult]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-12-07 12:05:43,256 INFO L246 CegarLoopResult]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,256 INFO L246 CegarLoopResult]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-12-07 12:05:43,256 INFO L246 CegarLoopResult]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-12-07 12:05:43,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:05:43 BoogieIcfgContainer [2019-12-07 12:05:43,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:05:43,291 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:05:43,292 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:05:43,292 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:05:43,292 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:04:52" (3/4) ... [2019-12-07 12:05:43,294 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:05:43,317 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 12:05:43,320 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 12:05:43,471 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3924ea1a-06e3-4bd6-b8d3-9e30211755c5/bin/uautomizer/witness.graphml [2019-12-07 12:05:43,471 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:05:43,472 INFO L168 Benchmark]: Toolchain (without parser) took 53001.86 ms. Allocated memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: 4.1 GB). Free memory was 934.0 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-12-07 12:05:43,472 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:05:43,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 623.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -132.7 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:05:43,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.56 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: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:05:43,473 INFO L168 Benchmark]: Boogie Preprocessor took 70.37 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: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:05:43,473 INFO L168 Benchmark]: RCFGBuilder took 1257.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -186.1 MB). Peak memory consumption was 270.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:05:43,473 INFO L168 Benchmark]: TraceAbstraction took 50775.44 ms. Allocated memory was 1.3 GB in the beginning and 5.2 GB in the end (delta: 3.9 GB). Free memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2019-12-07 12:05:43,473 INFO L168 Benchmark]: Witness Printer took 179.51 ms. Allocated memory is still 5.2 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 75.6 MB). Peak memory consumption was 75.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:05:43,475 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 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 623.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -132.7 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.56 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: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.37 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: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1257.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -186.1 MB). Peak memory consumption was 270.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 50775.44 ms. Allocated memory was 1.3 GB in the beginning and 5.2 GB in the end (delta: 3.9 GB). Free memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. * Witness Printer took 179.51 ms. Allocated memory is still 5.2 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 75.6 MB). Peak memory consumption was 75.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1647]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((1 == a3 && 1 == a5) && a12 == 1) && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a4) || (((((a3 <= 0 && 1 == a5) && a12 == 1) && a11 <= 0) && !(1 == a6)) && 1 == a4)) || (((((a27 == 1 && 1 == a5) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && 1 == a0)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a15 == 1) && 1 == a4)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && 1 == a0)) || (((((a27 == 1 && 1 == a5) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || (((((((1 <= a3 && 1 == a5) && !(a27 == 1)) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a16 == 1) && a15 == 1)) || ((((((1 == a3 && a27 == 1) && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a16 == 1)) || (((((a27 == 1 && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && 1 == a0)) || ((((((((1 <= a3 && 1 == a5) && a12 == 1) && !(a27 == 1)) && !(1 == a6)) && a11 == 1) && a16 == 1) && a26 == 1) && 1 == a4)) || ((((((a3 <= 0 && 1 == a5) && 1 == a6) && !(a27 == 1)) && a11 <= 0) && 1 == a0) && a16 == 1)) || (((((a27 == 1 && 1 == a5) && a11 <= 0) && a26 == 1) && a15 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1) && a15 == 1)) || ((((((1 == a5 && 1 == a6) && !(a27 == 1)) && a11 <= 0) && 1 == a0) && a16 == 1) && 1 == a4)) || ((((((a3 <= 0 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 <= 0) && a16 == 1) && 1 == a4)) || (((((((1 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || ((((((a3 <= 0 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 <= 0) && a15 == 1) && 1 == a4)) || (((((1 <= a3 && 1 == a5) && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a0)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && 1 == a4)) || ((((((1 == a3 && 1 == a5) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && a26 == 1) && 1 == a4)) || ((((((((a3 <= 0 && 1 == a5) && a12 == 1) && !(a27 == 1)) && 1 == a8) && !(1 == a6)) && a11 == 1) && a16 == 1) && a26 == 1)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && a11 == 1) && a26 == 1) && 1 == a0) && 1 == a4)) || (((((1 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && a11 <= 0) && 1 == a0)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && a26 == 1) && a16 == 1)) || (((((1 <= a3 && 1 == a5) && !(a12 == 1)) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((a3 <= 0 && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((((1 <= a3 && 1 == a5) && a12 == 1) && a11 == 1) && !(1 == a6)) && a26 == 1) && a15 == 1) && 1 == a4)) || (((((((a3 <= 0 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 == 1) && a16 == 1) && a26 == 1) && 1 == a4)) || ((((((((a3 <= 0 && 1 == a5) && 1 == a6) && !(a27 == 1)) && a11 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && 1 == a4)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 == 1)) || (((((1 <= a3 && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && 1 == a0)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && a26 == 1)) || (((((a27 == 1 && 1 == a5) && a11 <= 0) && a26 == 1) && 1 == a0) && a15 == 1)) || (((((1 == a3 && 1 == a5) && 1 == a6) && a11 <= 0) && 1 == a0) && 1 == a4)) || ((((((a3 <= 0 && 1 == a5) && a12 == 1) && a11 <= 0) && 1 == a8) && !(1 == a6)) && a15 == 1)) || ((((((((1 == a5 && !(a27 == 1)) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a16 == 1) && a26 == 1) && 1 == a0) && a15 == 1)) || ((((((1 <= a3 && 1 == a5) && a12 == 1) && a11 <= 0) && !(1 == a6)) && a26 == 1) && a15 == 1)) || ((((((1 <= a3 && a27 == 1) && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a26 == 1)) || ((((((1 <= a3 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 == 1) && a26 == 1) && a15 == 1)) || (((((1 == a3 && 1 == a5) && 1 == a6) && a11 <= 0) && a26 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && a12 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((((1 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && a11 <= 0) && a15 == 1) && 1 == a4)) || (((((1 <= a3 && a27 == 1) && 1 == a5) && a11 <= 0) && 1 == a8) && 1 == a0)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && 1 == a0) && a15 == 1)) || (((((a27 == 1 && 1 == a5) && a11 <= 0) && 1 == a0) && a26 == 1) && 1 == a4)) || ((((((((1 == a5 && a12 == 1) && !(a27 == 1)) && !(1 == a6)) && a11 == 1) && a16 == 1) && a26 == 1) && 1 == a0) && 1 == a4)) || (((((1 <= a3 && 1 == a5) && a12 == 1) && a11 <= 0) && a26 == 1) && 1 == a0)) || ((((((a27 == 1 && 1 == a3) && 1 == a5) && !(a12 == 1)) && 1 == a8) && a11 == 1) && a26 == 1)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1) && a15 == 1)) || (((((1 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 <= 0)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && a11 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || (((((1 == a3 && 1 == a5) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && 1 == a0)) || (((((((a3 <= 0 && 1 == a5) && a12 == 1) && !(a27 == 1)) && a11 <= 0) && !(1 == a6)) && a16 == 1) && 1 == a0)) || ((((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && !(a27 == 1)) && a11 == 1) && a16 == 1)) || ((((((1 <= a3 && 1 == a5) && a12 == 1) && a11 <= 0) && a26 == 1) && a15 == 1) && 1 == a4)) || (((((((1 <= a3 && a27 == 1) && 1 == a5) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && a26 == 1) && a15 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((1 == a3 && 1 == a5) && a12 == 1) && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a4) || (((((a3 <= 0 && 1 == a5) && a12 == 1) && a11 <= 0) && !(1 == a6)) && 1 == a4)) || (((((a27 == 1 && 1 == a5) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && 1 == a0)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a15 == 1) && 1 == a4)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && 1 == a0)) || (((((a27 == 1 && 1 == a5) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || (((((((1 <= a3 && 1 == a5) && !(a27 == 1)) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a16 == 1) && a15 == 1)) || ((((((1 == a3 && a27 == 1) && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a16 == 1)) || (((((a27 == 1 && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && 1 == a0)) || ((((((((1 <= a3 && 1 == a5) && a12 == 1) && !(a27 == 1)) && !(1 == a6)) && a11 == 1) && a16 == 1) && a26 == 1) && 1 == a4)) || ((((((a3 <= 0 && 1 == a5) && 1 == a6) && !(a27 == 1)) && a11 <= 0) && 1 == a0) && a16 == 1)) || (((((a27 == 1 && 1 == a5) && a11 <= 0) && a26 == 1) && a15 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1) && a15 == 1)) || ((((((1 == a5 && 1 == a6) && !(a27 == 1)) && a11 <= 0) && 1 == a0) && a16 == 1) && 1 == a4)) || ((((((a3 <= 0 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 <= 0) && a16 == 1) && 1 == a4)) || (((((((1 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || ((((((a3 <= 0 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 <= 0) && a15 == 1) && 1 == a4)) || (((((1 <= a3 && 1 == a5) && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a0)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && 1 == a4)) || ((((((1 == a3 && 1 == a5) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && a26 == 1) && 1 == a4)) || ((((((((a3 <= 0 && 1 == a5) && a12 == 1) && !(a27 == 1)) && 1 == a8) && !(1 == a6)) && a11 == 1) && a16 == 1) && a26 == 1)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && a11 == 1) && a26 == 1) && 1 == a0) && 1 == a4)) || (((((1 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && a11 <= 0) && 1 == a0)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && a26 == 1) && a16 == 1)) || (((((1 <= a3 && 1 == a5) && !(a12 == 1)) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((a3 <= 0 && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((((1 <= a3 && 1 == a5) && a12 == 1) && a11 == 1) && !(1 == a6)) && a26 == 1) && a15 == 1) && 1 == a4)) || (((((((a3 <= 0 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 == 1) && a16 == 1) && a26 == 1) && 1 == a4)) || ((((((((a3 <= 0 && 1 == a5) && 1 == a6) && !(a27 == 1)) && a11 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && 1 == a4)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 == 1)) || (((((1 <= a3 && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && 1 == a0)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && a26 == 1)) || (((((a27 == 1 && 1 == a5) && a11 <= 0) && a26 == 1) && 1 == a0) && a15 == 1)) || (((((1 == a3 && 1 == a5) && 1 == a6) && a11 <= 0) && 1 == a0) && 1 == a4)) || ((((((a3 <= 0 && 1 == a5) && a12 == 1) && a11 <= 0) && 1 == a8) && !(1 == a6)) && a15 == 1)) || ((((((((1 == a5 && !(a27 == 1)) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a16 == 1) && a26 == 1) && 1 == a0) && a15 == 1)) || ((((((1 <= a3 && 1 == a5) && a12 == 1) && a11 <= 0) && !(1 == a6)) && a26 == 1) && a15 == 1)) || ((((((1 <= a3 && a27 == 1) && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a26 == 1)) || ((((((1 <= a3 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 == 1) && a26 == 1) && a15 == 1)) || (((((1 == a3 && 1 == a5) && 1 == a6) && a11 <= 0) && a26 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && a12 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((((1 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && a11 <= 0) && a15 == 1) && 1 == a4)) || (((((1 <= a3 && a27 == 1) && 1 == a5) && a11 <= 0) && 1 == a8) && 1 == a0)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && 1 == a0) && a15 == 1)) || (((((a27 == 1 && 1 == a5) && a11 <= 0) && 1 == a0) && a26 == 1) && 1 == a4)) || ((((((((1 == a5 && a12 == 1) && !(a27 == 1)) && !(1 == a6)) && a11 == 1) && a16 == 1) && a26 == 1) && 1 == a0) && 1 == a4)) || (((((1 <= a3 && 1 == a5) && a12 == 1) && a11 <= 0) && a26 == 1) && 1 == a0)) || ((((((a27 == 1 && 1 == a3) && 1 == a5) && !(a12 == 1)) && 1 == a8) && a11 == 1) && a26 == 1)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1) && a15 == 1)) || (((((1 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 <= 0)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && a11 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || (((((1 == a3 && 1 == a5) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && 1 == a0)) || (((((((a3 <= 0 && 1 == a5) && a12 == 1) && !(a27 == 1)) && a11 <= 0) && !(1 == a6)) && a16 == 1) && 1 == a0)) || ((((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && !(a27 == 1)) && a11 == 1) && a16 == 1)) || ((((((1 <= a3 && 1 == a5) && a12 == 1) && a11 <= 0) && a26 == 1) && a15 == 1) && 1 == a4)) || (((((((1 <= a3 && a27 == 1) && 1 == a5) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && a26 == 1) && a15 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 31.6s, OverallIterations: 19, TraceHistogramMax: 6, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.0s, HoareTripleCheckerStatistics: 4133 SDtfs, 5525 SDslu, 1702 SDs, 0 SdLazy, 10810 SolverSat, 2193 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 949 GetRequests, 910 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196456occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 6233 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1914 NumberOfFragments, 2639 HoareAnnotationTreeSize, 3 FomulaSimplifications, 53844 FormulaSimplificationTreeSizeReduction, 10.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 43918 FormulaSimplificationTreeSizeReductionInter, 8.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 6792 NumberOfCodeBlocks, 6792 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6770 ConstructedInterpolants, 0 QuantifiedInterpolants, 3386746 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1515 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 3549/3559 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...