./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label00.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/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 4bee55207936bfc858217d6eb21ff7cffafc0723 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:47:14,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:47:14,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:47:14,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:47:14,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:47:14,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:47:14,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:47:14,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:47:14,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:47:14,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:47:14,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:47:14,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:47:14,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:47:14,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:47:14,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:47:14,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:47:14,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:47:14,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:47:14,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:47:14,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:47:14,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:47:14,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:47:14,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:47:14,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:47:14,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:47:14,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:47:14,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:47:14,946 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:47:14,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:47:14,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:47:14,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:47:14,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:47:14,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:47:14,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:47:14,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:47:14,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:47:14,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:47:14,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:47:14,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:47:14,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:47:14,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:47:14,956 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:47:14,986 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:47:14,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:47:14,987 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:47:14,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:47:14,988 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:47:14,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:47:14,989 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:47:14,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:47:14,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:47:14,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:47:14,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:47:14,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:47:14,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:47:14,990 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:47:14,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:47:14,991 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:47:14,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:47:14,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:47:14,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:47:14,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:47:14,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:47:14,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:47:14,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:47:14,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:47:14,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:47:14,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:47:14,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:47:14,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:47:14,994 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_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/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 -> 4bee55207936bfc858217d6eb21ff7cffafc0723 [2019-11-15 22:47:15,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:47:15,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:47:15,042 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:47:15,043 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:47:15,044 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:47:15,046 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label00.c [2019-11-15 22:47:15,104 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/bin/uautomizer/data/8d280c75c/11482fd42139457ea085c893f29f58be/FLAG14710d0b3 [2019-11-15 22:47:15,714 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:47:15,714 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/sv-benchmarks/c/eca-rers2012/Problem14_label00.c [2019-11-15 22:47:15,743 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/bin/uautomizer/data/8d280c75c/11482fd42139457ea085c893f29f58be/FLAG14710d0b3 [2019-11-15 22:47:15,953 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/bin/uautomizer/data/8d280c75c/11482fd42139457ea085c893f29f58be [2019-11-15 22:47:15,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:47:15,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:47:15,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:47:15,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:47:15,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:47:15,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:47:15" (1/1) ... [2019-11-15 22:47:15,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c99c520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:15, skipping insertion in model container [2019-11-15 22:47:15,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:47:15" (1/1) ... [2019-11-15 22:47:15,975 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:47:16,028 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:47:16,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:47:16,617 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:47:16,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:47:16,782 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:47:16,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:16 WrapperNode [2019-11-15 22:47:16,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:47:16,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:47:16,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:47:16,784 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:47:16,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:16" (1/1) ... [2019-11-15 22:47:16,825 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:16" (1/1) ... [2019-11-15 22:47:16,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:47:16,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:47:16,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:47:16,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:47:16,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:16" (1/1) ... [2019-11-15 22:47:16,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:16" (1/1) ... [2019-11-15 22:47:16,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:16" (1/1) ... [2019-11-15 22:47:16,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:16" (1/1) ... [2019-11-15 22:47:17,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:16" (1/1) ... [2019-11-15 22:47:17,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:16" (1/1) ... [2019-11-15 22:47:17,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:16" (1/1) ... [2019-11-15 22:47:17,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:47:17,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:47:17,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:47:17,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:47:17,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/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-11-15 22:47:17,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:47:17,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:47:19,051 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:47:19,051 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:47:19,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:47:19 BoogieIcfgContainer [2019-11-15 22:47:19,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:47:19,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:47:19,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:47:19,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:47:19,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:47:15" (1/3) ... [2019-11-15 22:47:19,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eeebaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:47:19, skipping insertion in model container [2019-11-15 22:47:19,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:16" (2/3) ... [2019-11-15 22:47:19,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eeebaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:47:19, skipping insertion in model container [2019-11-15 22:47:19,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:47:19" (3/3) ... [2019-11-15 22:47:19,068 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label00.c [2019-11-15 22:47:19,080 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:47:19,089 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:47:19,102 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:47:19,145 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:47:19,145 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:47:19,146 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:47:19,146 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:47:19,146 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:47:19,146 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:47:19,147 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:47:19,147 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:47:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-15 22:47:19,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:47:19,192 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:47:19,193 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:47:19,196 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:47:19,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:19,204 INFO L82 PathProgramCache]: Analyzing trace with hash -92557335, now seen corresponding path program 1 times [2019-11-15 22:47:19,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:19,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624901437] [2019-11-15 22:47:19,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:19,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:19,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:47:19,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624901437] [2019-11-15 22:47:19,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:47:19,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:47:19,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446866391] [2019-11-15 22:47:19,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:47:19,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:47:19,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:47:19,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:47:19,632 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-15 22:47:22,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:47:22,132 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2019-11-15 22:47:22,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:47:22,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-15 22:47:22,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:47:22,157 INFO L225 Difference]: With dead ends: 850 [2019-11-15 22:47:22,157 INFO L226 Difference]: Without dead ends: 538 [2019-11-15 22:47:22,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:47:22,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-15 22:47:22,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-15 22:47:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-15 22:47:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 826 transitions. [2019-11-15 22:47:22,248 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 826 transitions. Word has length 53 [2019-11-15 22:47:22,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:47:22,249 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 826 transitions. [2019-11-15 22:47:22,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:47:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 826 transitions. [2019-11-15 22:47:22,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-15 22:47:22,256 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:47:22,256 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:47:22,257 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:47:22,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:22,257 INFO L82 PathProgramCache]: Analyzing trace with hash 665233748, now seen corresponding path program 1 times [2019-11-15 22:47:22,257 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:22,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509956543] [2019-11-15 22:47:22,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:22,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:22,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:47:22,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509956543] [2019-11-15 22:47:22,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:47:22,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:47:22,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404464663] [2019-11-15 22:47:22,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:47:22,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:47:22,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:47:22,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:47:22,544 INFO L87 Difference]: Start difference. First operand 538 states and 826 transitions. Second operand 4 states. [2019-11-15 22:47:24,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:47:24,032 INFO L93 Difference]: Finished difference Result 2142 states and 3296 transitions. [2019-11-15 22:47:24,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:47:24,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-15 22:47:24,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:47:24,049 INFO L225 Difference]: With dead ends: 2142 [2019-11-15 22:47:24,049 INFO L226 Difference]: Without dead ends: 1606 [2019-11-15 22:47:24,053 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:47:24,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-15 22:47:24,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2019-11-15 22:47:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2019-11-15 22:47:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2256 transitions. [2019-11-15 22:47:24,131 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2256 transitions. Word has length 118 [2019-11-15 22:47:24,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:47:24,132 INFO L462 AbstractCegarLoop]: Abstraction has 1606 states and 2256 transitions. [2019-11-15 22:47:24,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:47:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2256 transitions. [2019-11-15 22:47:24,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 22:47:24,135 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:47:24,135 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:47:24,136 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:47:24,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:24,136 INFO L82 PathProgramCache]: Analyzing trace with hash -282099970, now seen corresponding path program 1 times [2019-11-15 22:47:24,137 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:24,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451670211] [2019-11-15 22:47:24,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:24,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:24,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:47:24,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451670211] [2019-11-15 22:47:24,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:47:24,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:47:24,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042112182] [2019-11-15 22:47:24,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:47:24,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:47:24,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:47:24,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:47:24,331 INFO L87 Difference]: Start difference. First operand 1606 states and 2256 transitions. Second operand 4 states. [2019-11-15 22:47:26,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:47:26,038 INFO L93 Difference]: Finished difference Result 4992 states and 7086 transitions. [2019-11-15 22:47:26,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:47:26,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-15 22:47:26,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:47:26,062 INFO L225 Difference]: With dead ends: 4992 [2019-11-15 22:47:26,063 INFO L226 Difference]: Without dead ends: 3388 [2019-11-15 22:47:26,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:47:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2019-11-15 22:47:26,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3208. [2019-11-15 22:47:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-11-15 22:47:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 4196 transitions. [2019-11-15 22:47:26,159 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 4196 transitions. Word has length 121 [2019-11-15 22:47:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:47:26,160 INFO L462 AbstractCegarLoop]: Abstraction has 3208 states and 4196 transitions. [2019-11-15 22:47:26,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:47:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 4196 transitions. [2019-11-15 22:47:26,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-15 22:47:26,164 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:47:26,164 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:47:26,165 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:47:26,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:26,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1253085156, now seen corresponding path program 1 times [2019-11-15 22:47:26,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:26,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471436503] [2019-11-15 22:47:26,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:26,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:26,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:47:26,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471436503] [2019-11-15 22:47:26,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389596023] [2019-11-15 22:47:26,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/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-11-15 22:47:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:26,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:47:26,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:47:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:47:26,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:47:26,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 22:47:26,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74998990] [2019-11-15 22:47:26,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:47:26,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:47:26,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:47:26,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:47:26,591 INFO L87 Difference]: Start difference. First operand 3208 states and 4196 transitions. Second operand 3 states. [2019-11-15 22:47:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:47:27,677 INFO L93 Difference]: Finished difference Result 7482 states and 9887 transitions. [2019-11-15 22:47:27,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:47:27,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-15 22:47:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:47:27,707 INFO L225 Difference]: With dead ends: 7482 [2019-11-15 22:47:27,708 INFO L226 Difference]: Without dead ends: 4454 [2019-11-15 22:47:27,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:47:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-11-15 22:47:27,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 3920. [2019-11-15 22:47:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-15 22:47:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 5028 transitions. [2019-11-15 22:47:27,822 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 5028 transitions. Word has length 133 [2019-11-15 22:47:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:47:27,823 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 5028 transitions. [2019-11-15 22:47:27,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:47:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 5028 transitions. [2019-11-15 22:47:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-15 22:47:27,830 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:47:27,831 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:47:28,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:47:28,041 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:47:28,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:28,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1257352591, now seen corresponding path program 1 times [2019-11-15 22:47:28,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:28,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743530994] [2019-11-15 22:47:28,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:28,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:28,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 154 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-15 22:47:28,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743530994] [2019-11-15 22:47:28,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118741077] [2019-11-15 22:47:28,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/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-11-15 22:47:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:28,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:47:28,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:47:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-15 22:47:28,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:47:28,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 22:47:28,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276966437] [2019-11-15 22:47:28,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:47:28,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:47:28,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:47:28,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:47:28,627 INFO L87 Difference]: Start difference. First operand 3920 states and 5028 transitions. Second operand 3 states. [2019-11-15 22:47:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:47:29,544 INFO L93 Difference]: Finished difference Result 8372 states and 10883 transitions. [2019-11-15 22:47:29,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:47:29,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-11-15 22:47:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:47:29,570 INFO L225 Difference]: With dead ends: 8372 [2019-11-15 22:47:29,570 INFO L226 Difference]: Without dead ends: 4632 [2019-11-15 22:47:29,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:47:29,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-11-15 22:47:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 3920. [2019-11-15 22:47:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-15 22:47:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4839 transitions. [2019-11-15 22:47:29,679 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4839 transitions. Word has length 294 [2019-11-15 22:47:29,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:47:29,681 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4839 transitions. [2019-11-15 22:47:29,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:47:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4839 transitions. [2019-11-15 22:47:29,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-11-15 22:47:29,692 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:47:29,692 INFO L380 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:47:29,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:47:29,897 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:47:29,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:29,897 INFO L82 PathProgramCache]: Analyzing trace with hash 2139630150, now seen corresponding path program 1 times [2019-11-15 22:47:29,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:29,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879403255] [2019-11-15 22:47:29,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:29,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:29,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 262 proven. 4 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-15 22:47:30,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879403255] [2019-11-15 22:47:30,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013878559] [2019-11-15 22:47:30,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/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-11-15 22:47:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:30,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:47:30,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:47:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-11-15 22:47:30,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:47:30,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 22:47:30,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118908832] [2019-11-15 22:47:30,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:47:30,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:47:30,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:47:30,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:47:30,603 INFO L87 Difference]: Start difference. First operand 3920 states and 4839 transitions. Second operand 3 states. [2019-11-15 22:47:31,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:47:31,474 INFO L93 Difference]: Finished difference Result 7482 states and 9302 transitions. [2019-11-15 22:47:31,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:47:31,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 354 [2019-11-15 22:47:31,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:47:31,502 INFO L225 Difference]: With dead ends: 7482 [2019-11-15 22:47:31,502 INFO L226 Difference]: Without dead ends: 3920 [2019-11-15 22:47:31,506 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 353 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:47:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-11-15 22:47:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2019-11-15 22:47:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-11-15 22:47:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4546 transitions. [2019-11-15 22:47:31,602 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4546 transitions. Word has length 354 [2019-11-15 22:47:31,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:47:31,603 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 4546 transitions. [2019-11-15 22:47:31,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:47:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4546 transitions. [2019-11-15 22:47:31,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-11-15 22:47:31,615 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:47:31,616 INFO L380 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:47:31,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:47:31,820 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:47:31,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:31,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1290220651, now seen corresponding path program 1 times [2019-11-15 22:47:31,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:31,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345473105] [2019-11-15 22:47:31,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:31,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:31,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 261 proven. 4 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-15 22:47:32,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345473105] [2019-11-15 22:47:32,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399163006] [2019-11-15 22:47:32,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:47:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:32,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:47:32,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:47:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-15 22:47:32,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:47:32,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2019-11-15 22:47:32,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885539653] [2019-11-15 22:47:32,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:47:32,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:47:32,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:47:32,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:47:32,757 INFO L87 Difference]: Start difference. First operand 3742 states and 4546 transitions. Second operand 4 states. [2019-11-15 22:47:34,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:47:34,305 INFO L93 Difference]: Finished difference Result 8914 states and 10948 transitions. [2019-11-15 22:47:34,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:47:34,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 361 [2019-11-15 22:47:34,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:47:34,331 INFO L225 Difference]: With dead ends: 8914 [2019-11-15 22:47:34,332 INFO L226 Difference]: Without dead ends: 5344 [2019-11-15 22:47:34,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 360 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:47:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2019-11-15 22:47:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4810. [2019-11-15 22:47:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2019-11-15 22:47:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5833 transitions. [2019-11-15 22:47:34,449 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5833 transitions. Word has length 361 [2019-11-15 22:47:34,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:47:34,449 INFO L462 AbstractCegarLoop]: Abstraction has 4810 states and 5833 transitions. [2019-11-15 22:47:34,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:47:34,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5833 transitions. [2019-11-15 22:47:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-11-15 22:47:34,466 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:47:34,467 INFO L380 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:47:34,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:47:34,672 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:47:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:34,672 INFO L82 PathProgramCache]: Analyzing trace with hash 135550644, now seen corresponding path program 1 times [2019-11-15 22:47:34,672 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:34,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755375739] [2019-11-15 22:47:34,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:34,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:34,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 262 proven. 4 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-11-15 22:47:35,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755375739] [2019-11-15 22:47:35,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435004224] [2019-11-15 22:47:35,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:47:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:35,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:47:35,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:47:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-11-15 22:47:35,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:47:35,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 22:47:35,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65953130] [2019-11-15 22:47:35,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:47:35,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:47:35,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:47:35,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:47:35,589 INFO L87 Difference]: Start difference. First operand 4810 states and 5833 transitions. Second operand 4 states. [2019-11-15 22:47:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:47:36,536 INFO L93 Difference]: Finished difference Result 9320 states and 11342 transitions. [2019-11-15 22:47:36,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:47:36,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 418 [2019-11-15 22:47:36,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:47:36,575 INFO L225 Difference]: With dead ends: 9320 [2019-11-15 22:47:36,575 INFO L226 Difference]: Without dead ends: 4810 [2019-11-15 22:47:36,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 417 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:47:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2019-11-15 22:47:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4632. [2019-11-15 22:47:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-15 22:47:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 5079 transitions. [2019-11-15 22:47:36,688 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 5079 transitions. Word has length 418 [2019-11-15 22:47:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:47:36,688 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 5079 transitions. [2019-11-15 22:47:36,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:47:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 5079 transitions. [2019-11-15 22:47:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2019-11-15 22:47:36,708 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:47:36,709 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:47:36,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:47:36,922 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:47:36,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:36,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1744234854, now seen corresponding path program 1 times [2019-11-15 22:47:36,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:36,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391957269] [2019-11-15 22:47:36,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:36,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:36,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 452 proven. 65 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-15 22:47:37,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391957269] [2019-11-15 22:47:37,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769936161] [2019-11-15 22:47:37,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:47:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:38,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:47:38,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:47:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 553 proven. 134 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-15 22:47:38,806 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:47:38,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-15 22:47:38,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76921292] [2019-11-15 22:47:38,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:47:38,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:47:38,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:47:38,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:47:38,810 INFO L87 Difference]: Start difference. First operand 4632 states and 5079 transitions. Second operand 11 states. [2019-11-15 22:47:45,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:47:45,909 INFO L93 Difference]: Finished difference Result 11410 states and 12607 transitions. [2019-11-15 22:47:45,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:47:45,910 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 513 [2019-11-15 22:47:45,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:47:45,921 INFO L225 Difference]: With dead ends: 11410 [2019-11-15 22:47:45,921 INFO L226 Difference]: Without dead ends: 5350 [2019-11-15 22:47:45,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:47:45,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5350 states. [2019-11-15 22:47:45,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5350 to 4454. [2019-11-15 22:47:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-15 22:47:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4692 transitions. [2019-11-15 22:47:46,006 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4692 transitions. Word has length 513 [2019-11-15 22:47:46,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:47:46,007 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4692 transitions. [2019-11-15 22:47:46,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:47:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4692 transitions. [2019-11-15 22:47:46,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2019-11-15 22:47:46,024 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:47:46,026 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:47:46,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:47:46,231 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:47:46,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:46,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1910546673, now seen corresponding path program 1 times [2019-11-15 22:47:46,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:46,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807935209] [2019-11-15 22:47:46,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:46,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:46,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-11-15 22:47:48,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807935209] [2019-11-15 22:47:48,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:47:48,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:47:48,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816677599] [2019-11-15 22:47:48,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:47:48,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:47:48,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:47:48,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:47:48,549 INFO L87 Difference]: Start difference. First operand 4454 states and 4692 transitions. Second operand 6 states. [2019-11-15 22:47:49,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:47:49,717 INFO L93 Difference]: Finished difference Result 9461 states and 9951 transitions. [2019-11-15 22:47:49,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:47:49,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 939 [2019-11-15 22:47:49,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:47:49,729 INFO L225 Difference]: With dead ends: 9461 [2019-11-15 22:47:49,729 INFO L226 Difference]: Without dead ends: 5365 [2019-11-15 22:47:49,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:47:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5365 states. [2019-11-15 22:47:49,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5365 to 4454. [2019-11-15 22:47:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-15 22:47:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4692 transitions. [2019-11-15 22:47:49,812 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4692 transitions. Word has length 939 [2019-11-15 22:47:49,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:47:49,814 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4692 transitions. [2019-11-15 22:47:49,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:47:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4692 transitions. [2019-11-15 22:47:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 947 [2019-11-15 22:47:49,828 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:47:49,829 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 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] [2019-11-15 22:47:49,830 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:47:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:49,831 INFO L82 PathProgramCache]: Analyzing trace with hash 29750968, now seen corresponding path program 1 times [2019-11-15 22:47:49,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:49,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322357262] [2019-11-15 22:47:49,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:49,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:49,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2541 backedges. 1781 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-11-15 22:47:52,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322357262] [2019-11-15 22:47:52,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:47:52,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:47:52,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692654764] [2019-11-15 22:47:52,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:47:52,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:47:52,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:47:52,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:47:52,508 INFO L87 Difference]: Start difference. First operand 4454 states and 4692 transitions. Second operand 7 states. [2019-11-15 22:47:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:47:53,755 INFO L93 Difference]: Finished difference Result 9443 states and 9932 transitions. [2019-11-15 22:47:53,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:47:53,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 946 [2019-11-15 22:47:53,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:47:53,767 INFO L225 Difference]: With dead ends: 9443 [2019-11-15 22:47:53,767 INFO L226 Difference]: Without dead ends: 5169 [2019-11-15 22:47:53,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:47:53,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5169 states. [2019-11-15 22:47:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5169 to 4632. [2019-11-15 22:47:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-15 22:47:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4872 transitions. [2019-11-15 22:47:53,855 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4872 transitions. Word has length 946 [2019-11-15 22:47:53,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:47:53,857 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4872 transitions. [2019-11-15 22:47:53,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:47:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4872 transitions. [2019-11-15 22:47:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1015 [2019-11-15 22:47:53,873 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:47:53,874 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:47:53,875 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:47:53,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:53,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1371405250, now seen corresponding path program 1 times [2019-11-15 22:47:53,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:53,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925637498] [2019-11-15 22:47:53,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:53,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:53,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2877 backedges. 1094 proven. 617 refuted. 0 times theorem prover too weak. 1166 trivial. 0 not checked. [2019-11-15 22:47:56,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925637498] [2019-11-15 22:47:56,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333390005] [2019-11-15 22:47:56,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:47:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:57,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 22:47:57,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:47:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2877 backedges. 859 proven. 267 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2019-11-15 22:47:58,408 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:47:58,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-11-15 22:47:58,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256277850] [2019-11-15 22:47:58,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:47:58,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:47:58,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:47:58,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:47:58,413 INFO L87 Difference]: Start difference. First operand 4632 states and 4872 transitions. Second operand 9 states. [2019-11-15 22:48:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:02,101 INFO L93 Difference]: Finished difference Result 10235 states and 10806 transitions. [2019-11-15 22:48:02,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 22:48:02,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1014 [2019-11-15 22:48:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:02,115 INFO L225 Difference]: With dead ends: 10235 [2019-11-15 22:48:02,115 INFO L226 Difference]: Without dead ends: 5783 [2019-11-15 22:48:02,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 1011 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:48:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5783 states. [2019-11-15 22:48:02,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5783 to 5166. [2019-11-15 22:48:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2019-11-15 22:48:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5406 transitions. [2019-11-15 22:48:02,214 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5406 transitions. Word has length 1014 [2019-11-15 22:48:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:02,215 INFO L462 AbstractCegarLoop]: Abstraction has 5166 states and 5406 transitions. [2019-11-15 22:48:02,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:48:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5406 transitions. [2019-11-15 22:48:02,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1106 [2019-11-15 22:48:02,235 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:02,236 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 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] [2019-11-15 22:48:02,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:48:02,448 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:02,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:02,449 INFO L82 PathProgramCache]: Analyzing trace with hash -263384217, now seen corresponding path program 1 times [2019-11-15 22:48:02,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:02,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943615413] [2019-11-15 22:48:02,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:02,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:02,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3816 backedges. 1306 proven. 0 refuted. 0 times theorem prover too weak. 2510 trivial. 0 not checked. [2019-11-15 22:48:04,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943615413] [2019-11-15 22:48:04,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:04,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:48:04,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925668182] [2019-11-15 22:48:04,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:48:04,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:04,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:48:04,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:48:04,564 INFO L87 Difference]: Start difference. First operand 5166 states and 5406 transitions. Second operand 7 states. [2019-11-15 22:48:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:05,247 INFO L93 Difference]: Finished difference Result 10068 states and 10526 transitions. [2019-11-15 22:48:05,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:48:05,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1105 [2019-11-15 22:48:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:05,257 INFO L225 Difference]: With dead ends: 10068 [2019-11-15 22:48:05,257 INFO L226 Difference]: Without dead ends: 4988 [2019-11-15 22:48:05,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:48:05,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-11-15 22:48:05,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4988. [2019-11-15 22:48:05,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-11-15 22:48:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5195 transitions. [2019-11-15 22:48:05,340 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5195 transitions. Word has length 1105 [2019-11-15 22:48:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:05,342 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5195 transitions. [2019-11-15 22:48:05,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:48:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5195 transitions. [2019-11-15 22:48:05,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1200 [2019-11-15 22:48:05,362 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:05,363 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:05,363 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:05,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:05,364 INFO L82 PathProgramCache]: Analyzing trace with hash 668795038, now seen corresponding path program 1 times [2019-11-15 22:48:05,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:05,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656989167] [2019-11-15 22:48:05,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:05,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:05,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4652 backedges. 1455 proven. 0 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2019-11-15 22:48:06,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656989167] [2019-11-15 22:48:06,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:06,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:48:06,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363420064] [2019-11-15 22:48:06,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:48:06,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:06,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:48:06,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:48:06,770 INFO L87 Difference]: Start difference. First operand 4988 states and 5195 transitions. Second operand 5 states. [2019-11-15 22:48:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:07,993 INFO L93 Difference]: Finished difference Result 11042 states and 11541 transitions. [2019-11-15 22:48:07,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:48:07,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1199 [2019-11-15 22:48:07,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:08,003 INFO L225 Difference]: With dead ends: 11042 [2019-11-15 22:48:08,003 INFO L226 Difference]: Without dead ends: 4276 [2019-11-15 22:48:08,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:48:08,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-11-15 22:48:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 3920. [2019-11-15 22:48:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-15 22:48:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4024 transitions. [2019-11-15 22:48:08,073 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4024 transitions. Word has length 1199 [2019-11-15 22:48:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:08,074 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4024 transitions. [2019-11-15 22:48:08,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:48:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4024 transitions. [2019-11-15 22:48:08,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1202 [2019-11-15 22:48:08,093 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:08,094 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:08,095 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:08,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:08,096 INFO L82 PathProgramCache]: Analyzing trace with hash 33821815, now seen corresponding path program 1 times [2019-11-15 22:48:08,096 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:08,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073193189] [2019-11-15 22:48:08,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:08,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:08,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4145 backedges. 1331 proven. 0 refuted. 0 times theorem prover too weak. 2814 trivial. 0 not checked. [2019-11-15 22:48:09,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073193189] [2019-11-15 22:48:09,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:09,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:48:09,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998385455] [2019-11-15 22:48:09,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:48:09,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:09,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:48:09,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:48:09,739 INFO L87 Difference]: Start difference. First operand 3920 states and 4024 transitions. Second operand 4 states. [2019-11-15 22:48:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:10,538 INFO L93 Difference]: Finished difference Result 7836 states and 8047 transitions. [2019-11-15 22:48:10,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:48:10,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1201 [2019-11-15 22:48:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:10,541 INFO L225 Difference]: With dead ends: 7836 [2019-11-15 22:48:10,541 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:48:10,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:48:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:48:10,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:48:10,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:48:10,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:48:10,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1201 [2019-11-15 22:48:10,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:10,549 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:48:10,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:48:10,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:48:10,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:48:10,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:48:10,873 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 280 DAG size of output: 172 [2019-11-15 22:48:11,174 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 277 DAG size of output: 170 [2019-11-15 22:48:12,254 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 141 DAG size of output: 73 [2019-11-15 22:48:13,150 WARN L191 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 73 [2019-11-15 22:48:13,154 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-15 22:48:13,154 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-15 22:48:13,154 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,154 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,154 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,154 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-15 22:48:13,154 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 22:48:13,154 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 22:48:13,154 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 22:48:13,154 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-15 22:48:13,154 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-15 22:48:13,155 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-15 22:48:13,155 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-15 22:48:13,155 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,155 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,155 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,155 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-15 22:48:13,155 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-15 22:48:13,155 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 22:48:13,155 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 22:48:13,155 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 22:48:13,155 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-15 22:48:13,155 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-15 22:48:13,156 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-15 22:48:13,156 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,156 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,156 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,156 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-15 22:48:13,156 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 22:48:13,156 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 22:48:13,156 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 22:48:13,156 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-15 22:48:13,156 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-15 22:48:13,157 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-15 22:48:13,157 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-15 22:48:13,157 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-15 22:48:13,157 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,157 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,158 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,158 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-15 22:48:13,158 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 22:48:13,158 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 22:48:13,158 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 22:48:13,158 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-15 22:48:13,158 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-15 22:48:13,158 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-15 22:48:13,158 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,158 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,159 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,159 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-15 22:48:13,159 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 22:48:13,159 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 22:48:13,159 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 22:48:13,159 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-15 22:48:13,159 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-15 22:48:13,160 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-15 22:48:13,161 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-15 22:48:13,161 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-15 22:48:13,161 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,161 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,161 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,162 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-15 22:48:13,162 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 22:48:13,162 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 22:48:13,162 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 22:48:13,162 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-15 22:48:13,162 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-15 22:48:13,163 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-15 22:48:13,163 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-15 22:48:13,163 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,163 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,163 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,163 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 22:48:13,164 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 22:48:13,164 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 22:48:13,164 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-15 22:48:13,164 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-15 22:48:13,164 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-15 22:48:13,165 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-15 22:48:13,165 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-15 22:48:13,165 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,165 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,165 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,165 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-15 22:48:13,166 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-15 22:48:13,166 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:48:13,166 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 22:48:13,166 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 22:48:13,166 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 22:48:13,167 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-15 22:48:13,167 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-15 22:48:13,167 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-15 22:48:13,167 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,167 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,167 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,168 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 22:48:13,168 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 22:48:13,168 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 22:48:13,168 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-15 22:48:13,168 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-15 22:48:13,168 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-15 22:48:13,169 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-15 22:48:13,169 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-15 22:48:13,169 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,169 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,169 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,170 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-15 22:48:13,170 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2019-11-15 22:48:13,170 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-15 22:48:13,170 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 22:48:13,170 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 22:48:13,171 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 22:48:13,171 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-15 22:48:13,171 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 22:48:13,171 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-15 22:48:13,171 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-15 22:48:13,171 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,172 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,173 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,173 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-15 22:48:13,173 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 22:48:13,173 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 22:48:13,173 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 22:48:13,174 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-15 22:48:13,174 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-15 22:48:13,174 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-15 22:48:13,174 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-15 22:48:13,174 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,174 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,175 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,175 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-15 22:48:13,175 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 22:48:13,175 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 22:48:13,175 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 22:48:13,176 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-15 22:48:13,176 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-15 22:48:13,176 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-15 22:48:13,176 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-15 22:48:13,176 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,176 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,177 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-15 22:48:13,177 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 22:48:13,177 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 22:48:13,177 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-15 22:48:13,177 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-15 22:48:13,177 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-15 22:48:13,178 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-15 22:48:13,178 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-15 22:48:13,178 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,178 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,178 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-15 22:48:13,178 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 22:48:13,179 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 22:48:13,179 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-15 22:48:13,179 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-15 22:48:13,179 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-15 22:48:13,179 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,179 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,181 INFO L439 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse18 (+ ~a12~0 43))) (let ((.cse4 (<= .cse18 0)) (.cse5 (< 11 ~a12~0))) (let ((.cse11 (<= ~a12~0 80)) (.cse15 (or .cse4 .cse5)) (.cse6 (not (= 9 ~a15~0)))) (let ((.cse3 (not (= 5 ~a15~0))) (.cse12 (and .cse11 .cse15 (<= 8 ~a21~0) .cse6)) (.cse2 (= ~a21~0 7)) (.cse13 (< 0 .cse18)) (.cse10 (<= 9 ~a21~0)) (.cse16 (<= ~a12~0 11)) (.cse0 (<= 58 ~a12~0)) (.cse9 (<= ~a15~0 7)) (.cse7 (<= (+ ~a12~0 49) 0)) (.cse8 (<= ~a21~0 6)) (.cse14 (= 8 ~a15~0)) (.cse1 (= ~a24~0 1)) (.cse17 (= ~a21~0 9))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 (or .cse4 .cse5 (not (= 1 ULTIMATE.start_calculate_output_~input))) (= ~a21~0 8) (= ~a15~0 9)) (and .cse1 .cse6 .cse7 .cse8) (and .cse1 (= ~a15~0 5) .cse8) (and .cse9 .cse1 (and .cse10 .cse3)) (and .cse1 (= 7 ~a15~0)) (and .cse11 .cse0 .cse1) (and .cse10 .cse0 .cse1) (and .cse12 .cse1 .cse13) (and .cse12 .cse9 .cse1) (and .cse14 .cse1 .cse2 .cse7) (and (and .cse10 .cse15 .cse16) .cse1) (and .cse0 .cse1 .cse8) (and .cse14 .cse1 .cse2 .cse16 .cse13) (and .cse15 .cse9 .cse1 .cse8) (and .cse1 (and .cse10 (not .cse17) .cse16)) (and .cse0 .cse14 .cse1) (and .cse9 .cse7 .cse8) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse14 .cse1 .cse17)))))) [2019-11-15 22:48:13,181 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-15 22:48:13,181 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-15 22:48:13,182 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 22:48:13,182 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 22:48:13,182 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-15 22:48:13,182 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-15 22:48:13,182 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-15 22:48:13,182 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-15 22:48:13,183 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,183 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,183 INFO L446 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-15 22:48:13,183 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-15 22:48:13,183 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-15 22:48:13,184 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 22:48:13,184 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 22:48:13,184 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-15 22:48:13,184 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-15 22:48:13,184 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-15 22:48:13,184 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,185 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,185 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-15 22:48:13,185 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-15 22:48:13,185 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 22:48:13,185 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 22:48:13,185 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:48:13,186 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-15 22:48:13,186 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-15 22:48:13,186 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,186 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,186 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-15 22:48:13,186 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,187 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-15 22:48:13,187 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse18 (+ ~a12~0 43))) (let ((.cse4 (<= .cse18 0)) (.cse5 (< 11 ~a12~0))) (let ((.cse11 (<= ~a12~0 80)) (.cse15 (or .cse4 .cse5)) (.cse6 (not (= 9 ~a15~0)))) (let ((.cse3 (not (= 5 ~a15~0))) (.cse12 (and .cse11 .cse15 (<= 8 ~a21~0) .cse6)) (.cse2 (= ~a21~0 7)) (.cse13 (< 0 .cse18)) (.cse10 (<= 9 ~a21~0)) (.cse16 (<= ~a12~0 11)) (.cse0 (<= 58 ~a12~0)) (.cse9 (<= ~a15~0 7)) (.cse7 (<= (+ ~a12~0 49) 0)) (.cse8 (<= ~a21~0 6)) (.cse14 (= 8 ~a15~0)) (.cse1 (= ~a24~0 1)) (.cse17 (= ~a21~0 9))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 (or .cse4 .cse5 (not (= 1 ULTIMATE.start_calculate_output_~input))) (= ~a21~0 8) (= ~a15~0 9)) (and .cse1 .cse6 .cse7 .cse8) (and .cse1 (= ~a15~0 5) .cse8) (and .cse9 .cse1 (and .cse10 .cse3)) (and .cse1 (= 7 ~a15~0)) (and .cse11 .cse0 .cse1) (and .cse10 .cse0 .cse1) (and .cse12 .cse1 .cse13) (and .cse12 .cse9 .cse1) (and .cse14 .cse1 .cse2 .cse7) (and (and .cse10 .cse15 .cse16) .cse1) (and .cse0 .cse1 .cse8) (and .cse14 .cse1 .cse2 .cse16 .cse13) (and .cse15 .cse9 .cse1 .cse8) (and .cse1 (and .cse10 (not .cse17) .cse16)) (and .cse0 .cse14 .cse1) (and .cse9 .cse7 .cse8) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse14 .cse1 .cse17)))))) [2019-11-15 22:48:13,189 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-15 22:48:13,189 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-15 22:48:13,189 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 22:48:13,189 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 22:48:13,189 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-15 22:48:13,190 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-15 22:48:13,190 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-15 22:48:13,190 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-15 22:48:13,190 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-15 22:48:13,190 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,190 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,191 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,191 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-15 22:48:13,191 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 22:48:13,191 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 22:48:13,191 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 22:48:13,191 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-15 22:48:13,192 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-15 22:48:13,192 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-15 22:48:13,192 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-15 22:48:13,192 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-15 22:48:13,192 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,192 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,193 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,193 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-15 22:48:13,193 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-15 22:48:13,193 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 22:48:13,193 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 22:48:13,193 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:48:13,194 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 22:48:13,194 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-15 22:48:13,194 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-15 22:48:13,194 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-15 22:48:13,194 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,194 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,195 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,195 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-15 22:48:13,195 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 22:48:13,195 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 22:48:13,195 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 22:48:13,195 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-15 22:48:13,195 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-15 22:48:13,196 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-15 22:48:13,196 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-15 22:48:13,196 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-15 22:48:13,196 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,196 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,197 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:48:13,197 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-15 22:48:13,197 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 22:48:13,197 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 22:48:13,197 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 22:48:13,197 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-15 22:48:13,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:48:13 BoogieIcfgContainer [2019-11-15 22:48:13,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:48:13,231 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:48:13,231 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:48:13,232 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:48:13,232 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:47:19" (3/4) ... [2019-11-15 22:48:13,236 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:48:13,269 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:48:13,271 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:48:13,486 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bbea7c86-7c72-4e2a-a153-b7ae4c58704b/bin/uautomizer/witness.graphml [2019-11-15 22:48:13,486 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:48:13,488 INFO L168 Benchmark]: Toolchain (without parser) took 57531.27 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 946.1 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 209.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:48:13,488 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:48:13,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 825.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -176.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:48:13,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:48:13,490 INFO L168 Benchmark]: Boogie Preprocessor took 142.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:48:13,490 INFO L168 Benchmark]: RCFGBuilder took 1995.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.5 MB in the end (delta: 130.7 MB). Peak memory consumption was 130.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:48:13,496 INFO L168 Benchmark]: TraceAbstraction took 54176.40 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 975.5 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-11-15 22:48:13,497 INFO L168 Benchmark]: Witness Printer took 255.26 ms. Allocated memory is still 3.2 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:48:13,499 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.38 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 825.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -176.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 130.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 142.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1995.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.5 MB in the end (delta: 130.7 MB). Peak memory consumption was 130.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 54176.40 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 975.5 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 255.26 ms. Allocated memory is still 3.2 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 163]: 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: 880]: Loop Invariant Derived loop invariant: ((((((((((((((((((((58 <= a12 && a24 == 1) && a21 == 7) && !(5 == a15)) || (((a24 == 1 && ((a12 + 43 <= 0 || 11 < a12) || !(1 == input))) && a21 == 8) && a15 == 9)) || (((a24 == 1 && !(9 == a15)) && a12 + 49 <= 0) && a21 <= 6)) || ((a24 == 1 && a15 == 5) && a21 <= 6)) || ((a15 <= 7 && a24 == 1) && 9 <= a21 && !(5 == a15))) || (a24 == 1 && 7 == a15)) || ((a12 <= 80 && 58 <= a12) && a24 == 1)) || ((9 <= a21 && 58 <= a12) && a24 == 1)) || (((((a12 <= 80 && (a12 + 43 <= 0 || 11 < a12)) && 8 <= a21) && !(9 == a15)) && a24 == 1) && 0 < a12 + 43)) || (((((a12 <= 80 && (a12 + 43 <= 0 || 11 < a12)) && 8 <= a21) && !(9 == a15)) && a15 <= 7) && a24 == 1)) || (((8 == a15 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || (((9 <= a21 && (a12 + 43 <= 0 || 11 < a12)) && a12 <= 11) && a24 == 1)) || ((58 <= a12 && a24 == 1) && a21 <= 6)) || ((((8 == a15 && a24 == 1) && a21 == 7) && a12 <= 11) && 0 < a12 + 43)) || ((((a12 + 43 <= 0 || 11 < a12) && a15 <= 7) && a24 == 1) && a21 <= 6)) || (a24 == 1 && (9 <= a21 && !(a21 == 9)) && a12 <= 11)) || ((58 <= a12 && 8 == a15) && a24 == 1)) || ((a15 <= 7 && a12 + 49 <= 0) && a21 <= 6)) || (((!(5 == input) && 8 == a15) && a24 == 1) && a21 == 9) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((((((((((58 <= a12 && a24 == 1) && a21 == 7) && !(5 == a15)) || (((a24 == 1 && ((a12 + 43 <= 0 || 11 < a12) || !(1 == input))) && a21 == 8) && a15 == 9)) || (((a24 == 1 && !(9 == a15)) && a12 + 49 <= 0) && a21 <= 6)) || ((a24 == 1 && a15 == 5) && a21 <= 6)) || ((a15 <= 7 && a24 == 1) && 9 <= a21 && !(5 == a15))) || (a24 == 1 && 7 == a15)) || ((a12 <= 80 && 58 <= a12) && a24 == 1)) || ((9 <= a21 && 58 <= a12) && a24 == 1)) || (((((a12 <= 80 && (a12 + 43 <= 0 || 11 < a12)) && 8 <= a21) && !(9 == a15)) && a24 == 1) && 0 < a12 + 43)) || (((((a12 <= 80 && (a12 + 43 <= 0 || 11 < a12)) && 8 <= a21) && !(9 == a15)) && a15 <= 7) && a24 == 1)) || (((8 == a15 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || (((9 <= a21 && (a12 + 43 <= 0 || 11 < a12)) && a12 <= 11) && a24 == 1)) || ((58 <= a12 && a24 == 1) && a21 <= 6)) || ((((8 == a15 && a24 == 1) && a21 == 7) && a12 <= 11) && 0 < a12 + 43)) || ((((a12 + 43 <= 0 || 11 < a12) && a15 <= 7) && a24 == 1) && a21 <= 6)) || (a24 == 1 && (9 <= a21 && !(a21 == 9)) && a12 <= 11)) || ((58 <= a12 && 8 == a15) && a24 == 1)) || ((a15 <= 7 && a12 + 49 <= 0) && a21 <= 6)) || (((!(5 == input) && 8 == a15) && a24 == 1) && a21 == 9) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 54.0s, OverallIterations: 15, TraceHistogramMax: 11, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, HoareTripleCheckerStatistics: 1375 SDtfs, 5653 SDslu, 259 SDs, 0 SdLazy, 18995 SolverSat, 1893 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3189 GetRequests, 3085 SyntacticMatches, 9 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5166occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 5633 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 110 NumberOfFragments, 591 HoareAnnotationTreeSize, 3 FomulaSimplifications, 24832 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 11124 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 11856 NumberOfCodeBlocks, 11856 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 11834 ConstructedInterpolants, 0 QuantifiedInterpolants, 36086440 SizeOfPredicates, 17 NumberOfNonLiveVariables, 3873 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 26873/27976 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...