./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label29.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/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 a9547726c128170530daa9b8442c9d71a0bd2015 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 03:02:32,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:02:32,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:02:32,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:02:32,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:02:32,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:02:32,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:02:32,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:02:32,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:02:32,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:02:32,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:02:32,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:02:32,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:02:32,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:02:32,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:02:32,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:02:32,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:02:32,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:02:32,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:02:32,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:02:32,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:02:32,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:02:32,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:02:32,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:02:32,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:02:32,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:02:32,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:02:32,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:02:32,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:02:32,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:02:32,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:02:32,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:02:32,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:02:32,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:02:32,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:02:32,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:02:32,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:02:32,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:02:32,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:02:32,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:02:32,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:02:32,516 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:02:32,545 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:02:32,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:02:32,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:02:32,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:02:32,559 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:02:32,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:02:32,559 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:02:32,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:02:32,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:02:32,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:02:32,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:02:32,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:02:32,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:02:32,561 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:02:32,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:02:32,561 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:02:32,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:02:32,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:02:32,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:02:32,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:02:32,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:02:32,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:02:32,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:02:32,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:02:32,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:02:32,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:02:32,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:02:32,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:02:32,565 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_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/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 -> a9547726c128170530daa9b8442c9d71a0bd2015 [2019-11-20 03:02:32,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:02:32,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:02:32,790 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:02:32,792 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:02:32,792 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:02:32,793 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label29.c [2019-11-20 03:02:32,862 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/bin/uautomizer/data/b5a8a5a3a/8aca1d709b9f4b488c0ad2e394fd7628/FLAGb6951077e [2019-11-20 03:02:33,579 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:02:33,580 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/sv-benchmarks/c/eca-rers2012/Problem03_label29.c [2019-11-20 03:02:33,601 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/bin/uautomizer/data/b5a8a5a3a/8aca1d709b9f4b488c0ad2e394fd7628/FLAGb6951077e [2019-11-20 03:02:33,696 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/bin/uautomizer/data/b5a8a5a3a/8aca1d709b9f4b488c0ad2e394fd7628 [2019-11-20 03:02:33,699 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:02:33,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:02:33,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:02:33,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:02:33,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:02:33,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:02:33" (1/1) ... [2019-11-20 03:02:33,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@135a83a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:33, skipping insertion in model container [2019-11-20 03:02:33,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:02:33" (1/1) ... [2019-11-20 03:02:33,722 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:02:33,819 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:02:34,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:02:34,664 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:02:34,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:02:34,978 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:02:34,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:34 WrapperNode [2019-11-20 03:02:34,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:02:34,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:02:34,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:02:34,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:02:34,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:34" (1/1) ... [2019-11-20 03:02:35,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:34" (1/1) ... [2019-11-20 03:02:35,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:02:35,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:02:35,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:02:35,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:02:35,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:34" (1/1) ... [2019-11-20 03:02:35,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:34" (1/1) ... [2019-11-20 03:02:35,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:34" (1/1) ... [2019-11-20 03:02:35,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:34" (1/1) ... [2019-11-20 03:02:35,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:34" (1/1) ... [2019-11-20 03:02:35,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:34" (1/1) ... [2019-11-20 03:02:35,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:34" (1/1) ... [2019-11-20 03:02:35,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:02:35,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:02:35,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:02:35,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:02:35,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/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-20 03:02:35,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:02:35,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:02:37,714 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:02:37,714 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 03:02:37,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:02:37 BoogieIcfgContainer [2019-11-20 03:02:37,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:02:37,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:02:37,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:02:37,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:02:37,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:02:33" (1/3) ... [2019-11-20 03:02:37,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e1a0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:02:37, skipping insertion in model container [2019-11-20 03:02:37,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:34" (2/3) ... [2019-11-20 03:02:37,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e1a0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:02:37, skipping insertion in model container [2019-11-20 03:02:37,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:02:37" (3/3) ... [2019-11-20 03:02:37,725 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label29.c [2019-11-20 03:02:37,736 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:02:37,746 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:02:37,757 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:02:37,798 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:02:37,798 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:02:37,798 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:02:37,798 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:02:37,798 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:02:37,799 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:02:37,799 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:02:37,800 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:02:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-20 03:02:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 03:02:37,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:02:37,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:02:37,851 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:02:37,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:02:37,857 INFO L82 PathProgramCache]: Analyzing trace with hash 800753066, now seen corresponding path program 1 times [2019-11-20 03:02:37,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:02:37,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187307736] [2019-11-20 03:02:37,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:02:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:02:38,621 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-20 03:02:38,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187307736] [2019-11-20 03:02:38,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:02:38,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:02:38,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978776636] [2019-11-20 03:02:38,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:02:38,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:02:38,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:02:38,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:02:38,646 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-20 03:02:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:02:40,736 INFO L93 Difference]: Finished difference Result 1085 states and 1950 transitions. [2019-11-20 03:02:40,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:02:40,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-20 03:02:40,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:02:40,761 INFO L225 Difference]: With dead ends: 1085 [2019-11-20 03:02:40,762 INFO L226 Difference]: Without dead ends: 686 [2019-11-20 03:02:40,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:02:40,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-20 03:02:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 453. [2019-11-20 03:02:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-11-20 03:02:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 735 transitions. [2019-11-20 03:02:40,848 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 735 transitions. Word has length 178 [2019-11-20 03:02:40,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:02:40,850 INFO L462 AbstractCegarLoop]: Abstraction has 453 states and 735 transitions. [2019-11-20 03:02:40,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:02:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 735 transitions. [2019-11-20 03:02:40,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 03:02:40,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:02:40,857 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:02:40,857 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:02:40,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:02:40,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2040513926, now seen corresponding path program 1 times [2019-11-20 03:02:40,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:02:40,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817698853] [2019-11-20 03:02:40,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:02:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:02:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:02:40,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817698853] [2019-11-20 03:02:40,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:02:40,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:02:40,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226199952] [2019-11-20 03:02:40,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:02:40,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:02:40,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:02:40,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:02:40,990 INFO L87 Difference]: Start difference. First operand 453 states and 735 transitions. Second operand 4 states. [2019-11-20 03:02:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:02:42,755 INFO L93 Difference]: Finished difference Result 1748 states and 2863 transitions. [2019-11-20 03:02:42,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:02:42,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-11-20 03:02:42,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:02:42,764 INFO L225 Difference]: With dead ends: 1748 [2019-11-20 03:02:42,764 INFO L226 Difference]: Without dead ends: 1297 [2019-11-20 03:02:42,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:02:42,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-11-20 03:02:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 863. [2019-11-20 03:02:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-11-20 03:02:42,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1325 transitions. [2019-11-20 03:02:42,814 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1325 transitions. Word has length 183 [2019-11-20 03:02:42,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:02:42,815 INFO L462 AbstractCegarLoop]: Abstraction has 863 states and 1325 transitions. [2019-11-20 03:02:42,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:02:42,815 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1325 transitions. [2019-11-20 03:02:42,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-20 03:02:42,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:02:42,823 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:02:42,824 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:02:42,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:02:42,824 INFO L82 PathProgramCache]: Analyzing trace with hash 455255094, now seen corresponding path program 1 times [2019-11-20 03:02:42,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:02:42,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368221733] [2019-11-20 03:02:42,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:02:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:02:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:02:42,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368221733] [2019-11-20 03:02:42,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:02:42,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:02:42,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016830729] [2019-11-20 03:02:42,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:02:42,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:02:42,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:02:42,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:02:42,916 INFO L87 Difference]: Start difference. First operand 863 states and 1325 transitions. Second operand 3 states. [2019-11-20 03:02:43,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:02:43,964 INFO L93 Difference]: Finished difference Result 2552 states and 3927 transitions. [2019-11-20 03:02:43,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:02:43,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-20 03:02:43,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:02:43,978 INFO L225 Difference]: With dead ends: 2552 [2019-11-20 03:02:43,978 INFO L226 Difference]: Without dead ends: 1691 [2019-11-20 03:02:43,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:02:43,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2019-11-20 03:02:44,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1687. [2019-11-20 03:02:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1687 states. [2019-11-20 03:02:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2449 transitions. [2019-11-20 03:02:44,041 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2449 transitions. Word has length 184 [2019-11-20 03:02:44,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:02:44,044 INFO L462 AbstractCegarLoop]: Abstraction has 1687 states and 2449 transitions. [2019-11-20 03:02:44,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:02:44,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2449 transitions. [2019-11-20 03:02:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-20 03:02:44,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:02:44,059 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:02:44,059 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:02:44,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:02:44,060 INFO L82 PathProgramCache]: Analyzing trace with hash -726821495, now seen corresponding path program 1 times [2019-11-20 03:02:44,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:02:44,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894741448] [2019-11-20 03:02:44,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:02:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:02:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:02:44,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894741448] [2019-11-20 03:02:44,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:02:44,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:02:44,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122681581] [2019-11-20 03:02:44,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:02:44,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:02:44,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:02:44,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:02:44,258 INFO L87 Difference]: Start difference. First operand 1687 states and 2449 transitions. Second operand 3 states. [2019-11-20 03:02:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:02:45,430 INFO L93 Difference]: Finished difference Result 5013 states and 7296 transitions. [2019-11-20 03:02:45,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:02:45,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-20 03:02:45,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:02:45,450 INFO L225 Difference]: With dead ends: 5013 [2019-11-20 03:02:45,450 INFO L226 Difference]: Without dead ends: 3328 [2019-11-20 03:02:45,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:02:45,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2019-11-20 03:02:45,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 3311. [2019-11-20 03:02:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3311 states. [2019-11-20 03:02:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 4735 transitions. [2019-11-20 03:02:45,545 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 4735 transitions. Word has length 186 [2019-11-20 03:02:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:02:45,546 INFO L462 AbstractCegarLoop]: Abstraction has 3311 states and 4735 transitions. [2019-11-20 03:02:45,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:02:45,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 4735 transitions. [2019-11-20 03:02:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-20 03:02:45,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:02:45,555 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:02:45,556 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:02:45,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:02:45,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1403214167, now seen corresponding path program 1 times [2019-11-20 03:02:45,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:02:45,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358052884] [2019-11-20 03:02:45,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:02:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:02:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:02:45,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358052884] [2019-11-20 03:02:45,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:02:45,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:02:45,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522871999] [2019-11-20 03:02:45,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:02:45,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:02:45,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:02:45,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:02:45,710 INFO L87 Difference]: Start difference. First operand 3311 states and 4735 transitions. Second operand 4 states. [2019-11-20 03:02:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:02:47,190 INFO L93 Difference]: Finished difference Result 12510 states and 17955 transitions. [2019-11-20 03:02:47,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:02:47,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-20 03:02:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:02:47,232 INFO L225 Difference]: With dead ends: 12510 [2019-11-20 03:02:47,233 INFO L226 Difference]: Without dead ends: 9201 [2019-11-20 03:02:47,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:02:47,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9201 states. [2019-11-20 03:02:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9201 to 9199. [2019-11-20 03:02:47,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9199 states. [2019-11-20 03:02:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9199 states to 9199 states and 11486 transitions. [2019-11-20 03:02:47,414 INFO L78 Accepts]: Start accepts. Automaton has 9199 states and 11486 transitions. Word has length 197 [2019-11-20 03:02:47,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:02:47,414 INFO L462 AbstractCegarLoop]: Abstraction has 9199 states and 11486 transitions. [2019-11-20 03:02:47,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:02:47,415 INFO L276 IsEmpty]: Start isEmpty. Operand 9199 states and 11486 transitions. [2019-11-20 03:02:47,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-20 03:02:47,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:02:47,433 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:02:47,433 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:02:47,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:02:47,433 INFO L82 PathProgramCache]: Analyzing trace with hash -215854226, now seen corresponding path program 1 times [2019-11-20 03:02:47,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:02:47,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566355730] [2019-11-20 03:02:47,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:02:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:02:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:02:47,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566355730] [2019-11-20 03:02:47,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:02:47,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:02:47,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002255780] [2019-11-20 03:02:47,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:02:47,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:02:47,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:02:47,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:02:47,644 INFO L87 Difference]: Start difference. First operand 9199 states and 11486 transitions. Second operand 5 states. [2019-11-20 03:02:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:02:49,228 INFO L93 Difference]: Finished difference Result 28424 states and 35683 transitions. [2019-11-20 03:02:49,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:02:49,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 216 [2019-11-20 03:02:49,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:02:49,298 INFO L225 Difference]: With dead ends: 28424 [2019-11-20 03:02:49,298 INFO L226 Difference]: Without dead ends: 19227 [2019-11-20 03:02:49,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:02:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19227 states. [2019-11-20 03:02:49,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19227 to 18377. [2019-11-20 03:02:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18377 states. [2019-11-20 03:02:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18377 states to 18377 states and 22820 transitions. [2019-11-20 03:02:49,657 INFO L78 Accepts]: Start accepts. Automaton has 18377 states and 22820 transitions. Word has length 216 [2019-11-20 03:02:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:02:49,660 INFO L462 AbstractCegarLoop]: Abstraction has 18377 states and 22820 transitions. [2019-11-20 03:02:49,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:02:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 18377 states and 22820 transitions. [2019-11-20 03:02:49,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-20 03:02:49,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:02:49,701 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:02:49,702 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:02:49,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:02:49,706 INFO L82 PathProgramCache]: Analyzing trace with hash -82552671, now seen corresponding path program 1 times [2019-11-20 03:02:49,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:02:49,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262625439] [2019-11-20 03:02:49,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:02:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:02:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 03:02:49,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262625439] [2019-11-20 03:02:49,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:02:49,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:02:49,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009482837] [2019-11-20 03:02:49,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:02:49,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:02:49,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:02:49,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:02:49,983 INFO L87 Difference]: Start difference. First operand 18377 states and 22820 transitions. Second operand 3 states. [2019-11-20 03:02:50,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:02:50,664 INFO L93 Difference]: Finished difference Result 34878 states and 43337 transitions. [2019-11-20 03:02:50,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:02:50,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-11-20 03:02:50,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:02:50,695 INFO L225 Difference]: With dead ends: 34878 [2019-11-20 03:02:50,696 INFO L226 Difference]: Without dead ends: 16503 [2019-11-20 03:02:50,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:02:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16503 states. [2019-11-20 03:02:50,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16503 to 16503. [2019-11-20 03:02:50,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16503 states. [2019-11-20 03:02:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16503 states to 16503 states and 20026 transitions. [2019-11-20 03:02:50,944 INFO L78 Accepts]: Start accepts. Automaton has 16503 states and 20026 transitions. Word has length 239 [2019-11-20 03:02:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:02:50,945 INFO L462 AbstractCegarLoop]: Abstraction has 16503 states and 20026 transitions. [2019-11-20 03:02:50,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:02:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 16503 states and 20026 transitions. [2019-11-20 03:02:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-11-20 03:02:50,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:02:50,963 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:02:50,964 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:02:50,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:02:50,964 INFO L82 PathProgramCache]: Analyzing trace with hash 743628338, now seen corresponding path program 1 times [2019-11-20 03:02:50,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:02:50,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181350000] [2019-11-20 03:02:50,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:02:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:02:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 03:02:51,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181350000] [2019-11-20 03:02:51,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:02:51,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:02:51,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815776117] [2019-11-20 03:02:51,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:02:51,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:02:51,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:02:51,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:02:51,185 INFO L87 Difference]: Start difference. First operand 16503 states and 20026 transitions. Second operand 4 states. [2019-11-20 03:02:52,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:02:52,451 INFO L93 Difference]: Finished difference Result 32793 states and 39819 transitions. [2019-11-20 03:02:52,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:02:52,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-11-20 03:02:52,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:02:52,482 INFO L225 Difference]: With dead ends: 32793 [2019-11-20 03:02:52,482 INFO L226 Difference]: Without dead ends: 16292 [2019-11-20 03:02:52,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:02:52,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16292 states. [2019-11-20 03:02:52,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16292 to 13653. [2019-11-20 03:02:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13653 states. [2019-11-20 03:02:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13653 states to 13653 states and 15721 transitions. [2019-11-20 03:02:52,861 INFO L78 Accepts]: Start accepts. Automaton has 13653 states and 15721 transitions. Word has length 266 [2019-11-20 03:02:52,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:02:52,861 INFO L462 AbstractCegarLoop]: Abstraction has 13653 states and 15721 transitions. [2019-11-20 03:02:52,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:02:52,862 INFO L276 IsEmpty]: Start isEmpty. Operand 13653 states and 15721 transitions. [2019-11-20 03:02:52,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-20 03:02:52,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:02:52,878 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:02:52,878 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:02:52,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:02:52,879 INFO L82 PathProgramCache]: Analyzing trace with hash -173098499, now seen corresponding path program 1 times [2019-11-20 03:02:52,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:02:52,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503936645] [2019-11-20 03:02:52,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:02:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:02:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-20 03:02:53,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503936645] [2019-11-20 03:02:53,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:02:53,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:02:53,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698079536] [2019-11-20 03:02:53,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:02:53,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:02:53,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:02:53,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:02:53,046 INFO L87 Difference]: Start difference. First operand 13653 states and 15721 transitions. Second operand 4 states. [2019-11-20 03:02:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:02:54,740 INFO L93 Difference]: Finished difference Result 51949 states and 59802 transitions. [2019-11-20 03:02:54,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:02:54,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2019-11-20 03:02:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:02:54,795 INFO L225 Difference]: With dead ends: 51949 [2019-11-20 03:02:54,796 INFO L226 Difference]: Without dead ends: 38298 [2019-11-20 03:02:54,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:02:54,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38298 states. [2019-11-20 03:02:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38298 to 38294. [2019-11-20 03:02:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38294 states. [2019-11-20 03:02:55,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38294 states to 38294 states and 43994 transitions. [2019-11-20 03:02:55,397 INFO L78 Accepts]: Start accepts. Automaton has 38294 states and 43994 transitions. Word has length 278 [2019-11-20 03:02:55,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:02:55,398 INFO L462 AbstractCegarLoop]: Abstraction has 38294 states and 43994 transitions. [2019-11-20 03:02:55,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:02:55,398 INFO L276 IsEmpty]: Start isEmpty. Operand 38294 states and 43994 transitions. [2019-11-20 03:02:55,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-11-20 03:02:55,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:02:55,419 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 03:02:55,419 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:02:55,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:02:55,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1953792015, now seen corresponding path program 1 times [2019-11-20 03:02:55,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:02:55,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529074326] [2019-11-20 03:02:55,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:02:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:02:55,990 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 109 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 03:02:55,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529074326] [2019-11-20 03:02:55,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137020815] [2019-11-20 03:02:55,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/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-20 03:02:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:02:56,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:02:56,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:02:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 03:02:56,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:02:56,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-11-20 03:02:56,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354274222] [2019-11-20 03:02:56,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:02:56,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:02:56,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:02:56,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:02:56,317 INFO L87 Difference]: Start difference. First operand 38294 states and 43994 transitions. Second operand 3 states. [2019-11-20 03:02:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:02:56,979 INFO L93 Difference]: Finished difference Result 109525 states and 126031 transitions. [2019-11-20 03:02:56,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:02:56,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-11-20 03:02:56,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:02:57,072 INFO L225 Difference]: With dead ends: 109525 [2019-11-20 03:02:57,073 INFO L226 Difference]: Without dead ends: 71233 [2019-11-20 03:02:57,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:02:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71233 states. [2019-11-20 03:02:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71233 to 71231. [2019-11-20 03:02:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71231 states. [2019-11-20 03:02:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71231 states to 71231 states and 82008 transitions. [2019-11-20 03:02:57,947 INFO L78 Accepts]: Start accepts. Automaton has 71231 states and 82008 transitions. Word has length 288 [2019-11-20 03:02:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:02:57,948 INFO L462 AbstractCegarLoop]: Abstraction has 71231 states and 82008 transitions. [2019-11-20 03:02:57,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:02:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 71231 states and 82008 transitions. [2019-11-20 03:02:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-20 03:02:57,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:02:57,971 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:02:58,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:02:58,302 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:02:58,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:02:58,303 INFO L82 PathProgramCache]: Analyzing trace with hash 844494747, now seen corresponding path program 1 times [2019-11-20 03:02:58,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:02:58,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002820220] [2019-11-20 03:02:58,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:02:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:02:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-20 03:02:58,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002820220] [2019-11-20 03:02:58,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:02:58,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:02:58,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349533296] [2019-11-20 03:02:58,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:02:58,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:02:58,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:02:58,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:02:58,453 INFO L87 Difference]: Start difference. First operand 71231 states and 82008 transitions. Second operand 3 states. [2019-11-20 03:02:59,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:02:59,657 INFO L93 Difference]: Finished difference Result 142484 states and 164062 transitions. [2019-11-20 03:02:59,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:02:59,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-11-20 03:02:59,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:02:59,745 INFO L225 Difference]: With dead ends: 142484 [2019-11-20 03:02:59,745 INFO L226 Difference]: Without dead ends: 71255 [2019-11-20 03:02:59,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:02:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71255 states. [2019-11-20 03:03:00,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71255 to 70825. [2019-11-20 03:03:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70825 states. [2019-11-20 03:03:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70825 states to 70825 states and 79737 transitions. [2019-11-20 03:03:00,532 INFO L78 Accepts]: Start accepts. Automaton has 70825 states and 79737 transitions. Word has length 300 [2019-11-20 03:03:00,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:03:00,532 INFO L462 AbstractCegarLoop]: Abstraction has 70825 states and 79737 transitions. [2019-11-20 03:03:00,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:03:00,532 INFO L276 IsEmpty]: Start isEmpty. Operand 70825 states and 79737 transitions. [2019-11-20 03:03:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-11-20 03:03:00,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:03:00,544 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:03:00,545 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:03:00,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:03:00,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1976501505, now seen corresponding path program 1 times [2019-11-20 03:03:00,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:03:00,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280783640] [2019-11-20 03:03:00,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:03:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:03:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-20 03:03:00,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280783640] [2019-11-20 03:03:00,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:03:00,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:03:00,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716436395] [2019-11-20 03:03:00,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:03:00,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:03:00,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:03:00,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:03:00,721 INFO L87 Difference]: Start difference. First operand 70825 states and 79737 transitions. Second operand 3 states. [2019-11-20 03:03:02,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:03:02,245 INFO L93 Difference]: Finished difference Result 175250 states and 197766 transitions. [2019-11-20 03:03:02,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:03:02,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-11-20 03:03:02,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:03:02,346 INFO L225 Difference]: With dead ends: 175250 [2019-11-20 03:03:02,346 INFO L226 Difference]: Without dead ends: 104427 [2019-11-20 03:03:02,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:03:02,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104427 states. [2019-11-20 03:03:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104427 to 104421. [2019-11-20 03:03:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104421 states. [2019-11-20 03:03:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104421 states to 104421 states and 117899 transitions. [2019-11-20 03:03:03,443 INFO L78 Accepts]: Start accepts. Automaton has 104421 states and 117899 transitions. Word has length 313 [2019-11-20 03:03:03,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:03:03,444 INFO L462 AbstractCegarLoop]: Abstraction has 104421 states and 117899 transitions. [2019-11-20 03:03:03,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:03:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 104421 states and 117899 transitions. [2019-11-20 03:03:03,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-11-20 03:03:03,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:03:03,458 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:03:03,458 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:03:03,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:03:03,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1864009396, now seen corresponding path program 1 times [2019-11-20 03:03:03,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:03:03,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64986275] [2019-11-20 03:03:03,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:03:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:03:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-20 03:03:03,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64986275] [2019-11-20 03:03:03,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001749817] [2019-11-20 03:03:03,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/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-20 03:03:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:03:04,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:03:04,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:03:04,413 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-20 03:03:04,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:03:04,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-11-20 03:03:04,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413590498] [2019-11-20 03:03:04,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:03:04,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:03:04,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:03:04,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:03:04,416 INFO L87 Difference]: Start difference. First operand 104421 states and 117899 transitions. Second operand 3 states. [2019-11-20 03:03:06,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:03:06,367 INFO L93 Difference]: Finished difference Result 266583 states and 300236 transitions. [2019-11-20 03:03:06,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:03:06,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-11-20 03:03:06,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:03:06,693 INFO L225 Difference]: With dead ends: 266583 [2019-11-20 03:03:06,693 INFO L226 Difference]: Without dead ends: 162164 [2019-11-20 03:03:06,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:03:06,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162164 states. [2019-11-20 03:03:09,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162164 to 160309. [2019-11-20 03:03:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160309 states. [2019-11-20 03:03:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160309 states to 160309 states and 178700 transitions. [2019-11-20 03:03:09,825 INFO L78 Accepts]: Start accepts. Automaton has 160309 states and 178700 transitions. Word has length 320 [2019-11-20 03:03:09,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:03:09,825 INFO L462 AbstractCegarLoop]: Abstraction has 160309 states and 178700 transitions. [2019-11-20 03:03:09,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:03:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand 160309 states and 178700 transitions. [2019-11-20 03:03:09,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-11-20 03:03:09,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:03:09,900 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:03:10,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:03:10,111 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:03:10,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:03:10,112 INFO L82 PathProgramCache]: Analyzing trace with hash 594366740, now seen corresponding path program 1 times [2019-11-20 03:03:10,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:03:10,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185928380] [2019-11-20 03:03:10,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:03:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:03:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-20 03:03:10,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185928380] [2019-11-20 03:03:10,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:03:10,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:03:10,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813638906] [2019-11-20 03:03:10,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:03:10,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:03:10,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:03:10,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:03:10,404 INFO L87 Difference]: Start difference. First operand 160309 states and 178700 transitions. Second operand 5 states. [2019-11-20 03:03:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:03:13,016 INFO L93 Difference]: Finished difference Result 422246 states and 467693 transitions. [2019-11-20 03:03:13,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:03:13,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 320 [2019-11-20 03:03:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:03:13,339 INFO L225 Difference]: With dead ends: 422246 [2019-11-20 03:03:13,339 INFO L226 Difference]: Without dead ends: 261939 [2019-11-20 03:03:13,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:03:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261939 states. [2019-11-20 03:03:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261939 to 251132. [2019-11-20 03:03:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251132 states. [2019-11-20 03:03:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251132 states to 251132 states and 276832 transitions. [2019-11-20 03:03:20,971 INFO L78 Accepts]: Start accepts. Automaton has 251132 states and 276832 transitions. Word has length 320 [2019-11-20 03:03:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:03:20,972 INFO L462 AbstractCegarLoop]: Abstraction has 251132 states and 276832 transitions. [2019-11-20 03:03:20,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:03:20,972 INFO L276 IsEmpty]: Start isEmpty. Operand 251132 states and 276832 transitions. [2019-11-20 03:03:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-11-20 03:03:21,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:03:21,010 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:03:21,010 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:03:21,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:03:21,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1803227641, now seen corresponding path program 1 times [2019-11-20 03:03:21,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:03:21,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377539799] [2019-11-20 03:03:21,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:03:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:03:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-20 03:03:21,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377539799] [2019-11-20 03:03:21,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:03:21,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:03:21,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492160593] [2019-11-20 03:03:21,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:03:21,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:03:21,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:03:21,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:03:21,202 INFO L87 Difference]: Start difference. First operand 251132 states and 276832 transitions. Second operand 3 states. [2019-11-20 03:03:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:03:23,526 INFO L93 Difference]: Finished difference Result 502253 states and 553653 transitions. [2019-11-20 03:03:23,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:03:23,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2019-11-20 03:03:23,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:03:23,760 INFO L225 Difference]: With dead ends: 502253 [2019-11-20 03:03:23,760 INFO L226 Difference]: Without dead ends: 251123 [2019-11-20 03:03:23,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:03:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251123 states. [2019-11-20 03:03:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251123 to 251123. [2019-11-20 03:03:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251123 states. [2019-11-20 03:03:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251123 states to 251123 states and 276814 transitions. [2019-11-20 03:03:27,926 INFO L78 Accepts]: Start accepts. Automaton has 251123 states and 276814 transitions. Word has length 353 [2019-11-20 03:03:27,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:03:27,926 INFO L462 AbstractCegarLoop]: Abstraction has 251123 states and 276814 transitions. [2019-11-20 03:03:27,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:03:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 251123 states and 276814 transitions. [2019-11-20 03:03:27,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-11-20 03:03:27,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:03:27,957 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:03:27,957 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:03:27,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:03:27,958 INFO L82 PathProgramCache]: Analyzing trace with hash -963524122, now seen corresponding path program 1 times [2019-11-20 03:03:27,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:03:27,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753674520] [2019-11-20 03:03:27,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:03:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:03:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-20 03:03:28,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753674520] [2019-11-20 03:03:28,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:03:28,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:03:28,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186578944] [2019-11-20 03:03:28,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:03:28,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:03:28,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:03:28,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:03:28,205 INFO L87 Difference]: Start difference. First operand 251123 states and 276814 transitions. Second operand 4 states. [2019-11-20 03:03:30,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:03:30,801 INFO L93 Difference]: Finished difference Result 512307 states and 564690 transitions. [2019-11-20 03:03:30,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:03:30,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 368 [2019-11-20 03:03:30,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:03:31,072 INFO L225 Difference]: With dead ends: 512307 [2019-11-20 03:03:31,072 INFO L226 Difference]: Without dead ends: 261186 [2019-11-20 03:03:31,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:03:31,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261186 states. [2019-11-20 03:03:40,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261186 to 255008. [2019-11-20 03:03:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255008 states. [2019-11-20 03:03:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255008 states to 255008 states and 280728 transitions. [2019-11-20 03:03:40,695 INFO L78 Accepts]: Start accepts. Automaton has 255008 states and 280728 transitions. Word has length 368 [2019-11-20 03:03:40,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:03:40,695 INFO L462 AbstractCegarLoop]: Abstraction has 255008 states and 280728 transitions. [2019-11-20 03:03:40,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:03:40,695 INFO L276 IsEmpty]: Start isEmpty. Operand 255008 states and 280728 transitions. [2019-11-20 03:03:40,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-11-20 03:03:40,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:03:40,723 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:03:40,724 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:03:40,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:03:40,724 INFO L82 PathProgramCache]: Analyzing trace with hash 956977237, now seen corresponding path program 1 times [2019-11-20 03:03:40,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:03:40,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315374751] [2019-11-20 03:03:40,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:03:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:03:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:03:41,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315374751] [2019-11-20 03:03:41,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:03:41,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:03:41,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172184501] [2019-11-20 03:03:41,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:03:41,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:03:41,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:03:41,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:03:41,010 INFO L87 Difference]: Start difference. First operand 255008 states and 280728 transitions. Second operand 3 states. [2019-11-20 03:03:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:03:42,879 INFO L93 Difference]: Finished difference Result 477240 states and 525499 transitions. [2019-11-20 03:03:42,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:03:42,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 371 [2019-11-20 03:03:42,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:03:42,880 INFO L225 Difference]: With dead ends: 477240 [2019-11-20 03:03:42,880 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:03:42,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:03:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:03:42,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:03:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:03:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:03:42,983 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 371 [2019-11-20 03:03:42,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:03:42,984 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:03:42,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:03:42,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:03:42,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:03:42,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:03:47,320 WARN L191 SmtUtils]: Spent 4.30 s on a formula simplification. DAG size of input: 1412 DAG size of output: 279 [2019-11-20 03:03:50,928 WARN L191 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 1412 DAG size of output: 279 [2019-11-20 03:03:54,947 WARN L191 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 256 DAG size of output: 96 [2019-11-20 03:03:58,041 WARN L191 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 256 DAG size of output: 96 [2019-11-20 03:03:58,043 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-20 03:03:58,043 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-20 03:03:58,043 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,043 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,043 INFO L444 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,043 INFO L444 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,044 INFO L444 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,044 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,044 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,044 INFO L444 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-20 03:03:58,044 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,044 INFO L444 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-20 03:03:58,044 INFO L444 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-20 03:03:58,044 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,044 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,044 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,044 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,044 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-20 03:03:58,044 INFO L444 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-20 03:03:58,045 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,045 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,045 INFO L444 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,045 INFO L444 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,045 INFO L444 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,045 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,045 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,045 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,045 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,045 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,045 INFO L444 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-20 03:03:58,045 INFO L444 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-20 03:03:58,045 INFO L444 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-20 03:03:58,045 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,045 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,046 INFO L444 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,046 INFO L444 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,046 INFO L444 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,046 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,046 INFO L444 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-20 03:03:58,046 INFO L444 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-20 03:03:58,046 INFO L444 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-20 03:03:58,046 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,046 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,046 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,046 INFO L444 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,046 INFO L444 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,046 INFO L444 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,047 INFO L444 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-20 03:03:58,047 INFO L444 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-20 03:03:58,047 INFO L444 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-20 03:03:58,047 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,047 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,047 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,047 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-20 03:03:58,047 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,047 INFO L444 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-20 03:03:58,048 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,048 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,048 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-20 03:03:58,048 INFO L444 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-20 03:03:58,048 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,048 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,049 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,049 INFO L444 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,049 INFO L444 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,049 INFO L444 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,049 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,049 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-20 03:03:58,049 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-20 03:03:58,050 INFO L444 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-20 03:03:58,050 INFO L444 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-20 03:03:58,050 INFO L444 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-20 03:03:58,050 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,050 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,050 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,051 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,051 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,051 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,051 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,051 INFO L444 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,051 INFO L444 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,051 INFO L444 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,052 INFO L444 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-20 03:03:58,052 INFO L444 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-20 03:03:58,052 INFO L444 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-20 03:03:58,052 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,052 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,052 INFO L444 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,052 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,052 INFO L444 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,052 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,052 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,052 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,053 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,053 INFO L444 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-20 03:03:58,053 INFO L444 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-20 03:03:58,053 INFO L444 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-20 03:03:58,053 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-20 03:03:58,053 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-20 03:03:58,053 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,053 INFO L444 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,053 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,053 INFO L444 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,053 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,053 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 03:03:58,053 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,053 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,054 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,054 INFO L444 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-20 03:03:58,054 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-20 03:03:58,054 INFO L444 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-20 03:03:58,054 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,054 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,054 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,054 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-20 03:03:58,054 INFO L444 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-20 03:03:58,054 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,054 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,054 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,054 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-20 03:03:58,054 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,054 INFO L444 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-20 03:03:58,055 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,055 INFO L444 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-20 03:03:58,055 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,055 INFO L444 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,055 INFO L444 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-20 03:03:58,055 INFO L444 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-20 03:03:58,055 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-20 03:03:58,055 INFO L444 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-20 03:03:58,055 INFO L444 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-20 03:03:58,055 INFO L444 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-20 03:03:58,056 INFO L444 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-20 03:03:58,056 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,056 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,056 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,057 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse16 (= ~a12~0 1))) (let ((.cse0 (not .cse16)) (.cse17 (not (= ~a26~0 1)))) (let ((.cse14 (<= ~a27~0 0)) (.cse18 (= 0 ~a3~0)) (.cse8 (and .cse0 .cse17)) (.cse19 (= 1 ~a0~0)) (.cse7 (= ~a27~0 1)) (.cse20 (= ~a15~0 1)) (.cse3 (= 1 ~a3~0)) (.cse15 (= 1 ~a6~0)) (.cse4 (<= ~a11~0 0)) (.cse6 (= 1 ~a4~0)) (.cse10 (not (= ~a7~0 1))) (.cse1 (<= ~a6~0 0)) (.cse2 (= ~a18~0 1)) (.cse11 (= 1 ~a10~0)) (.cse9 (not (= ~a3~0 2))) (.cse5 (= ~a5~0 1)) (.cse12 (= ~a11~0 1)) (.cse13 (= ~a16~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse10 .cse1 .cse2 .cse11 .cse8 .cse5 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse16 .cse5 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse18 .cse5 .cse12 .cse19 .cse13 .cse14) (and .cse1 .cse2 .cse8 .cse5 .cse12 .cse19) (and .cse1 .cse2 .cse16 .cse4 .cse9 .cse5 .cse6 .cse17) (and .cse2 .cse7 .cse15 .cse11 .cse4 .cse9 .cse5 .cse13) (and .cse1 .cse2 .cse7 .cse8 .cse9 .cse5 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse9 .cse5 .cse12 .cse13) (and .cse1 .cse2 .cse7 .cse4 .cse8 .cse5 .cse19) (and .cse1 .cse2 .cse11 .cse16 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse15 .cse5 .cse12 .cse19) (and .cse10 .cse0 .cse2 .cse15 .cse11 .cse4 .cse5) (and .cse10 .cse1 .cse2 .cse11 .cse16 .cse4 .cse5) (and .cse2 .cse15 .cse11 .cse9 .cse5 .cse12 .cse13 .cse6) (and .cse2 .cse15 .cse18 .cse5 .cse12 .cse19) (and .cse1 .cse2 .cse3 .cse16 .cse5 .cse12 .cse6) (and .cse0 .cse2 .cse15 .cse4 .cse9 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse5 .cse12 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse19) (and .cse1 .cse2 .cse11 .cse16 .cse5 .cse12 .cse6) (and .cse1 .cse2 .cse11 .cse16 .cse4 .cse9 .cse5 .cse17) (and .cse1 .cse2 .cse7 .cse16 .cse4 .cse9 .cse5 .cse6) (and .cse10 .cse2 .cse15 .cse11 .cse4 .cse5 .cse6) (and .cse2 (and .cse1 (not .cse7) .cse9 .cse13) .cse11 .cse16 .cse5 .cse12) (and .cse1 .cse2 .cse3 .cse11 .cse4 .cse8 .cse5) (and .cse1 .cse2 .cse7 .cse16 .cse4 .cse9 .cse5 .cse20) (and .cse1 .cse2 .cse7 .cse3 .cse8 .cse5 .cse12 .cse13) (and .cse1 .cse2 .cse16 .cse5 .cse12 .cse19) (and .cse1 .cse2 .cse7 .cse5 .cse12 .cse19) (and .cse1 .cse2 .cse16 .cse4 .cse5 .cse19) (and .cse2 (and .cse10 .cse7 .cse15 .cse11 .cse4 .cse9 .cse5)) (and .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse17) (and .cse1 .cse2 .cse7 .cse11 .cse16 .cse4 .cse9 .cse5) (and .cse2 .cse15 .cse4 .cse5 .cse19) (and .cse2 .cse7 .cse15 .cse11 .cse12 .cse9 .cse5) (and .cse2 .cse7 .cse15 .cse11 .cse16 .cse4 .cse5 .cse20 .cse6) (and .cse0 .cse2 .cse7 .cse15 .cse9 .cse5 .cse12) (and .cse0 .cse10 .cse1 .cse2 .cse7 .cse11 .cse5 .cse12) (and .cse2 .cse7 .cse15 .cse5 .cse12 .cse13 .cse19) (and .cse10 .cse2 .cse7 .cse15 .cse11 .cse5 .cse12 .cse13 .cse6) (and .cse2 (and .cse7 .cse15 .cse4 .cse9 .cse5 .cse20 .cse6)) (and .cse0 .cse2 .cse15 .cse11 .cse5 .cse12) (and .cse2 .cse7 .cse15 .cse9 .cse5 .cse12 .cse13) (and .cse2 .cse7 .cse15 .cse12 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse5 .cse12 .cse19 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse4 .cse5 .cse20) (and .cse2 .cse3 .cse15 .cse4 .cse5 .cse6) (and .cse10 .cse1 .cse2 .cse11 .cse16 .cse9 .cse5 .cse12 .cse13))))) [2019-11-20 03:03:58,058 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,058 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,058 INFO L444 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,058 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-20 03:03:58,058 INFO L444 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-20 03:03:58,059 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,059 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,059 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 03:03:58,059 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1569) no Hoare annotation was computed. [2019-11-20 03:03:58,059 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,059 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-20 03:03:58,060 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,060 INFO L444 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,060 INFO L444 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,060 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,060 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,060 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,060 INFO L444 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-20 03:03:58,061 INFO L444 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-20 03:03:58,061 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,061 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,061 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,061 INFO L444 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,061 INFO L444 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,061 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,062 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,062 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,062 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,062 INFO L444 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-20 03:03:58,062 INFO L444 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-20 03:03:58,062 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,063 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,063 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-20 03:03:58,063 INFO L444 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-20 03:03:58,063 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,064 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse16 (= ~a12~0 1))) (let ((.cse0 (not .cse16)) (.cse17 (not (= ~a26~0 1)))) (let ((.cse14 (<= ~a27~0 0)) (.cse18 (= 0 ~a3~0)) (.cse8 (and .cse0 .cse17)) (.cse19 (= 1 ~a0~0)) (.cse7 (= ~a27~0 1)) (.cse20 (= ~a15~0 1)) (.cse3 (= 1 ~a3~0)) (.cse15 (= 1 ~a6~0)) (.cse4 (<= ~a11~0 0)) (.cse6 (= 1 ~a4~0)) (.cse10 (not (= ~a7~0 1))) (.cse1 (<= ~a6~0 0)) (.cse2 (= ~a18~0 1)) (.cse11 (= 1 ~a10~0)) (.cse9 (not (= ~a3~0 2))) (.cse5 (= ~a5~0 1)) (.cse12 (= ~a11~0 1)) (.cse13 (= ~a16~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse10 .cse1 .cse2 .cse11 .cse8 .cse5 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse16 .cse5 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse18 .cse5 .cse12 .cse19 .cse13 .cse14) (and .cse1 .cse2 .cse8 .cse5 .cse12 .cse19) (and .cse1 .cse2 .cse16 .cse4 .cse9 .cse5 .cse6 .cse17) (and .cse2 .cse7 .cse15 .cse11 .cse4 .cse9 .cse5 .cse13) (and .cse1 .cse2 .cse7 .cse8 .cse9 .cse5 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse9 .cse5 .cse12 .cse13) (and .cse1 .cse2 .cse7 .cse4 .cse8 .cse5 .cse19) (and .cse1 .cse2 .cse11 .cse16 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse15 .cse5 .cse12 .cse19) (and .cse10 .cse0 .cse2 .cse15 .cse11 .cse4 .cse5) (and .cse10 .cse1 .cse2 .cse11 .cse16 .cse4 .cse5) (and .cse2 .cse15 .cse11 .cse9 .cse5 .cse12 .cse13 .cse6) (and .cse2 .cse15 .cse18 .cse5 .cse12 .cse19) (and .cse1 .cse2 .cse3 .cse16 .cse5 .cse12 .cse6) (and .cse0 .cse2 .cse15 .cse4 .cse9 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse5 .cse12 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse19) (and .cse1 .cse2 .cse11 .cse16 .cse5 .cse12 .cse6) (and .cse1 .cse2 .cse11 .cse16 .cse4 .cse9 .cse5 .cse17) (and .cse1 .cse2 .cse7 .cse16 .cse4 .cse9 .cse5 .cse6) (and .cse10 .cse2 .cse15 .cse11 .cse4 .cse5 .cse6) (and .cse2 (and .cse1 (not .cse7) .cse9 .cse13) .cse11 .cse16 .cse5 .cse12) (and .cse1 .cse2 .cse3 .cse11 .cse4 .cse8 .cse5) (and .cse1 .cse2 .cse7 .cse16 .cse4 .cse9 .cse5 .cse20) (and .cse1 .cse2 .cse7 .cse3 .cse8 .cse5 .cse12 .cse13) (and .cse1 .cse2 .cse16 .cse5 .cse12 .cse19) (and .cse1 .cse2 .cse7 .cse5 .cse12 .cse19) (and .cse1 .cse2 .cse16 .cse4 .cse5 .cse19) (and .cse2 (and .cse10 .cse7 .cse15 .cse11 .cse4 .cse9 .cse5)) (and .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse17) (and .cse1 .cse2 .cse7 .cse11 .cse16 .cse4 .cse9 .cse5) (and .cse2 .cse15 .cse4 .cse5 .cse19) (and .cse2 .cse7 .cse15 .cse11 .cse12 .cse9 .cse5) (and .cse2 .cse7 .cse15 .cse11 .cse16 .cse4 .cse5 .cse20 .cse6) (and .cse0 .cse2 .cse7 .cse15 .cse9 .cse5 .cse12) (and .cse0 .cse10 .cse1 .cse2 .cse7 .cse11 .cse5 .cse12) (and .cse2 .cse7 .cse15 .cse5 .cse12 .cse13 .cse19) (and .cse10 .cse2 .cse7 .cse15 .cse11 .cse5 .cse12 .cse13 .cse6) (and .cse2 (and .cse7 .cse15 .cse4 .cse9 .cse5 .cse20 .cse6)) (and .cse0 .cse2 .cse15 .cse11 .cse5 .cse12) (and .cse2 .cse7 .cse15 .cse9 .cse5 .cse12 .cse13) (and .cse2 .cse7 .cse15 .cse12 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse5 .cse12 .cse19 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse4 .cse5 .cse20) (and .cse2 .cse3 .cse15 .cse4 .cse5 .cse6) (and .cse10 .cse1 .cse2 .cse11 .cse16 .cse9 .cse5 .cse12 .cse13))))) [2019-11-20 03:03:58,064 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,064 INFO L444 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,064 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,064 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,064 INFO L444 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-20 03:03:58,064 INFO L444 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-20 03:03:58,065 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,065 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,065 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,065 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,065 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,065 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,065 INFO L444 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,065 INFO L444 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,065 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-20 03:03:58,065 INFO L444 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-20 03:03:58,065 INFO L444 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-20 03:03:58,065 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,065 INFO L444 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-20 03:03:58,065 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,066 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,066 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-20 03:03:58,066 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,066 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,066 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,066 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,066 INFO L444 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,066 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-20 03:03:58,066 INFO L444 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,066 INFO L444 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-20 03:03:58,066 INFO L444 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-20 03:03:58,066 INFO L444 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-20 03:03:58,066 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,066 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,067 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,067 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,067 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,067 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,067 INFO L444 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,067 INFO L444 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,067 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-20 03:03:58,067 INFO L444 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-20 03:03:58,067 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,067 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,067 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-20 03:03:58,067 INFO L444 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-20 03:03:58,067 INFO L444 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-20 03:03:58,068 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,068 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,068 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,068 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,068 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,068 INFO L444 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,068 INFO L444 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,069 INFO L444 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,069 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,069 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,069 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,069 INFO L444 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-20 03:03:58,069 INFO L444 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-20 03:03:58,070 INFO L444 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-20 03:03:58,070 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 03:03:58,070 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,070 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,070 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,070 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,070 INFO L444 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,070 INFO L444 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,071 INFO L444 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,071 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-20 03:03:58,071 INFO L444 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-20 03:03:58,071 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,071 INFO L444 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-20 03:03:58,071 INFO L444 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-20 03:03:58,071 INFO L444 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-20 03:03:58,071 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,071 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,072 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,072 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,072 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,072 INFO L444 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-20 03:03:58,072 INFO L444 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-20 03:03:58,072 INFO L444 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,073 INFO L444 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,073 INFO L444 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,073 INFO L444 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-20 03:03:58,073 INFO L444 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-20 03:03:58,073 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,073 INFO L444 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-20 03:03:58,074 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,074 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,074 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,074 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,074 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,074 INFO L444 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,074 INFO L444 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,075 INFO L444 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,075 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,075 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,075 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 03:03:58,075 INFO L444 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-20 03:03:58,075 INFO L444 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-20 03:03:58,075 INFO L444 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-20 03:03:58,075 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,075 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-20 03:03:58,075 INFO L444 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-20 03:03:58,075 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,076 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,076 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,076 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,076 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,076 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,076 INFO L444 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,076 INFO L444 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,076 INFO L444 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,076 INFO L444 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-20 03:03:58,076 INFO L444 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-20 03:03:58,076 INFO L444 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-20 03:03:58,076 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,076 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,076 INFO L444 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,077 INFO L444 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,077 INFO L444 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 03:03:58,077 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,077 INFO L444 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-20 03:03:58,077 INFO L444 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-20 03:03:58,077 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,077 INFO L444 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-20 03:03:58,077 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-20 03:03:58,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:03:58 BoogieIcfgContainer [2019-11-20 03:03:58,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:03:58,139 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:03:58,139 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:03:58,139 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:03:58,140 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:02:37" (3/4) ... [2019-11-20 03:03:58,143 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 03:03:58,181 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 03:03:58,185 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 03:03:58,434 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ec0d134b-5d16-4c62-a90b-360bd5f37ffc/bin/uautomizer/witness.graphml [2019-11-20 03:03:58,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:03:58,435 INFO L168 Benchmark]: Toolchain (without parser) took 84734.92 ms. Allocated memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: 4.2 GB). Free memory was 943.4 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-11-20 03:03:58,435 INFO L168 Benchmark]: CDTParser took 0.29 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-20 03:03:58,436 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1272.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 943.4 MB in the beginning and 1.0 GB in the end (delta: -96.7 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2019-11-20 03:03:58,436 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2019-11-20 03:03:58,437 INFO L168 Benchmark]: Boogie Preprocessor took 140.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2019-11-20 03:03:58,437 INFO L168 Benchmark]: RCFGBuilder took 2441.71 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 134.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -205.6 MB). Peak memory consumption was 274.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:03:58,438 INFO L168 Benchmark]: TraceAbstraction took 80422.11 ms. Allocated memory was 1.3 GB in the beginning and 5.2 GB in the end (delta: 3.9 GB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-11-20 03:03:58,438 INFO L168 Benchmark]: Witness Printer took 295.07 ms. Allocated memory is still 5.2 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 74.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:03:58,440 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.29 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 1272.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 943.4 MB in the beginning and 1.0 GB in the end (delta: -96.7 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 153.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 140.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2441.71 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 134.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -205.6 MB). Peak memory consumption was 274.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 80422.11 ms. Allocated memory was 1.3 GB in the beginning and 5.2 GB in the end (delta: 3.9 GB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 295.07 ms. Allocated memory is still 5.2 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 74.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1569]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((!(a12 == 1) && a6 <= 0) && a18 == 1) && 1 == a3) && a11 <= 0) && a5 == 1) && 1 == a4) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && a11 <= 0) && !(a12 == 1) && !(a26 == 1)) && !(a3 == 2)) && a5 == 1) && 1 == a4)) || ((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a10) && !(a12 == 1) && !(a26 == 1)) && a5 == 1) && a11 == 1) && a16 == 1) && a27 <= 0)) || ((((((((a18 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a11 == 1) && a16 == 1) && a27 <= 0) && !(a26 == 1))) || (((((((a6 <= 0 && a18 == 1) && 0 == a3) && a5 == 1) && a11 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || (((((a6 <= 0 && a18 == 1) && !(a12 == 1) && !(a26 == 1)) && a5 == 1) && a11 == 1) && 1 == a0)) || (((((((a6 <= 0 && a18 == 1) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && 1 == a4) && !(a26 == 1))) || (((((((a18 == 1 && a27 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && a16 == 1)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && !(a12 == 1) && !(a26 == 1)) && !(a3 == 2)) && a5 == 1) && a11 == 1) && 1 == a4)) || ((((((((!(a12 == 1) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a10) && !(a3 == 2)) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((((a6 <= 0 && a18 == 1) && a27 == 1) && a11 <= 0) && !(a12 == 1) && !(a26 == 1)) && a5 == 1) && 1 == a0)) || ((((((a6 <= 0 && a18 == 1) && 1 == a10) && a12 == 1) && a11 <= 0) && a5 == 1) && 1 == a4)) || (((((!(a12 == 1) && a18 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((((!(a7 == 1) && !(a12 == 1)) && a18 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a5 == 1)) || ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a10) && a12 == 1) && a11 <= 0) && a5 == 1)) || (((((((a18 == 1 && 1 == a6) && 1 == a10) && !(a3 == 2)) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || (((((a18 == 1 && 1 == a6) && 0 == a3) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && a12 == 1) && a5 == 1) && a11 == 1) && 1 == a4)) || (((((!(a12 == 1) && a18 == 1) && 1 == a6) && a11 <= 0) && !(a3 == 2)) && a5 == 1)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a3) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || (((((a6 <= 0 && a18 == 1) && 1 == a3) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((((a6 <= 0 && a18 == 1) && 1 == a10) && a12 == 1) && a5 == 1) && a11 == 1) && 1 == a4)) || (((((((a6 <= 0 && a18 == 1) && 1 == a10) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && !(a26 == 1))) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && 1 == a4)) || ((((((!(a7 == 1) && a18 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a5 == 1) && 1 == a4)) || (((((a18 == 1 && ((a6 <= 0 && !(a27 == 1)) && !(a3 == 2)) && a16 == 1) && 1 == a10) && a12 == 1) && a5 == 1) && a11 == 1)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && 1 == a10) && a11 <= 0) && !(a12 == 1) && !(a26 == 1)) && a5 == 1)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && a15 == 1)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a3) && !(a12 == 1) && !(a26 == 1)) && a5 == 1) && a11 == 1) && a16 == 1)) || (((((a6 <= 0 && a18 == 1) && a12 == 1) && a5 == 1) && a11 == 1) && 1 == a0)) || (((((a6 <= 0 && a18 == 1) && a27 == 1) && a5 == 1) && a11 == 1) && 1 == a0)) || (((((a6 <= 0 && a18 == 1) && a12 == 1) && a11 <= 0) && a5 == 1) && 1 == a0)) || (a18 == 1 && (((((!(a7 == 1) && a27 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && !(a3 == 2)) && a5 == 1)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && a12 == 1) && a11 <= 0) && a5 == 1) && !(a26 == 1))) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a10) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1)) || ((((a18 == 1 && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((((a18 == 1 && a27 == 1) && 1 == a6) && 1 == a10) && a11 == 1) && !(a3 == 2)) && a5 == 1)) || ((((((((a18 == 1 && a27 == 1) && 1 == a6) && 1 == a10) && a12 == 1) && a11 <= 0) && a5 == 1) && a15 == 1) && 1 == a4)) || ((((((!(a12 == 1) && a18 == 1) && a27 == 1) && 1 == a6) && !(a3 == 2)) && a5 == 1) && a11 == 1)) || (((((((!(a12 == 1) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a10) && a5 == 1) && a11 == 1)) || ((((((a18 == 1 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a0)) || ((((((((!(a7 == 1) && a18 == 1) && a27 == 1) && 1 == a6) && 1 == a10) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || (a18 == 1 && (((((a27 == 1 && 1 == a6) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && a15 == 1) && 1 == a4)) || (((((!(a12 == 1) && a18 == 1) && 1 == a6) && 1 == a10) && a5 == 1) && a11 == 1)) || ((((((a18 == 1 && a27 == 1) && 1 == a6) && !(a3 == 2)) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((((a18 == 1 && a27 == 1) && 1 == a6) && a11 == 1) && !(a3 == 2)) && a5 == 1) && 1 == a4)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && a5 == 1) && a11 == 1) && 1 == a0) && 1 == a4)) || (((((((!(a12 == 1) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a10) && a11 <= 0) && a5 == 1) && a15 == 1)) || (((((a18 == 1 && 1 == a3) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a4)) || ((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a10) && a12 == 1) && !(a3 == 2)) && a5 == 1) && a11 == 1) && a16 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((!(a12 == 1) && a6 <= 0) && a18 == 1) && 1 == a3) && a11 <= 0) && a5 == 1) && 1 == a4) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && a11 <= 0) && !(a12 == 1) && !(a26 == 1)) && !(a3 == 2)) && a5 == 1) && 1 == a4)) || ((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a10) && !(a12 == 1) && !(a26 == 1)) && a5 == 1) && a11 == 1) && a16 == 1) && a27 <= 0)) || ((((((((a18 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a11 == 1) && a16 == 1) && a27 <= 0) && !(a26 == 1))) || (((((((a6 <= 0 && a18 == 1) && 0 == a3) && a5 == 1) && a11 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || (((((a6 <= 0 && a18 == 1) && !(a12 == 1) && !(a26 == 1)) && a5 == 1) && a11 == 1) && 1 == a0)) || (((((((a6 <= 0 && a18 == 1) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && 1 == a4) && !(a26 == 1))) || (((((((a18 == 1 && a27 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && a16 == 1)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && !(a12 == 1) && !(a26 == 1)) && !(a3 == 2)) && a5 == 1) && a11 == 1) && 1 == a4)) || ((((((((!(a12 == 1) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a10) && !(a3 == 2)) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((((a6 <= 0 && a18 == 1) && a27 == 1) && a11 <= 0) && !(a12 == 1) && !(a26 == 1)) && a5 == 1) && 1 == a0)) || ((((((a6 <= 0 && a18 == 1) && 1 == a10) && a12 == 1) && a11 <= 0) && a5 == 1) && 1 == a4)) || (((((!(a12 == 1) && a18 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((((!(a7 == 1) && !(a12 == 1)) && a18 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a5 == 1)) || ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a10) && a12 == 1) && a11 <= 0) && a5 == 1)) || (((((((a18 == 1 && 1 == a6) && 1 == a10) && !(a3 == 2)) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || (((((a18 == 1 && 1 == a6) && 0 == a3) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && a12 == 1) && a5 == 1) && a11 == 1) && 1 == a4)) || (((((!(a12 == 1) && a18 == 1) && 1 == a6) && a11 <= 0) && !(a3 == 2)) && a5 == 1)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a3) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || (((((a6 <= 0 && a18 == 1) && 1 == a3) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((((a6 <= 0 && a18 == 1) && 1 == a10) && a12 == 1) && a5 == 1) && a11 == 1) && 1 == a4)) || (((((((a6 <= 0 && a18 == 1) && 1 == a10) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && !(a26 == 1))) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && 1 == a4)) || ((((((!(a7 == 1) && a18 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a5 == 1) && 1 == a4)) || (((((a18 == 1 && ((a6 <= 0 && !(a27 == 1)) && !(a3 == 2)) && a16 == 1) && 1 == a10) && a12 == 1) && a5 == 1) && a11 == 1)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && 1 == a10) && a11 <= 0) && !(a12 == 1) && !(a26 == 1)) && a5 == 1)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && a15 == 1)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a3) && !(a12 == 1) && !(a26 == 1)) && a5 == 1) && a11 == 1) && a16 == 1)) || (((((a6 <= 0 && a18 == 1) && a12 == 1) && a5 == 1) && a11 == 1) && 1 == a0)) || (((((a6 <= 0 && a18 == 1) && a27 == 1) && a5 == 1) && a11 == 1) && 1 == a0)) || (((((a6 <= 0 && a18 == 1) && a12 == 1) && a11 <= 0) && a5 == 1) && 1 == a0)) || (a18 == 1 && (((((!(a7 == 1) && a27 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && !(a3 == 2)) && a5 == 1)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && a12 == 1) && a11 <= 0) && a5 == 1) && !(a26 == 1))) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a10) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1)) || ((((a18 == 1 && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((((a18 == 1 && a27 == 1) && 1 == a6) && 1 == a10) && a11 == 1) && !(a3 == 2)) && a5 == 1)) || ((((((((a18 == 1 && a27 == 1) && 1 == a6) && 1 == a10) && a12 == 1) && a11 <= 0) && a5 == 1) && a15 == 1) && 1 == a4)) || ((((((!(a12 == 1) && a18 == 1) && a27 == 1) && 1 == a6) && !(a3 == 2)) && a5 == 1) && a11 == 1)) || (((((((!(a12 == 1) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a10) && a5 == 1) && a11 == 1)) || ((((((a18 == 1 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a0)) || ((((((((!(a7 == 1) && a18 == 1) && a27 == 1) && 1 == a6) && 1 == a10) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || (a18 == 1 && (((((a27 == 1 && 1 == a6) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && a15 == 1) && 1 == a4)) || (((((!(a12 == 1) && a18 == 1) && 1 == a6) && 1 == a10) && a5 == 1) && a11 == 1)) || ((((((a18 == 1 && a27 == 1) && 1 == a6) && !(a3 == 2)) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((((a18 == 1 && a27 == 1) && 1 == a6) && a11 == 1) && !(a3 == 2)) && a5 == 1) && 1 == a4)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && a5 == 1) && a11 == 1) && 1 == a0) && 1 == a4)) || (((((((!(a12 == 1) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a10) && a11 <= 0) && a5 == 1) && a15 == 1)) || (((((a18 == 1 && 1 == a3) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a4)) || ((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a10) && a12 == 1) && !(a3 == 2)) && a5 == 1) && a11 == 1) && a16 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 80.2s, OverallIterations: 17, TraceHistogramMax: 5, AutomataDifference: 29.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.0s, HoareTripleCheckerStatistics: 2220 SDtfs, 6865 SDslu, 1160 SDs, 0 SdLazy, 12724 SolverSat, 2323 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 658 GetRequests, 623 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255008occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 23461 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 2160 NumberOfFragments, 2483 HoareAnnotationTreeSize, 3 FomulaSimplifications, 123212 FormulaSimplificationTreeSizeReduction, 7.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 10546 FormulaSimplificationTreeSizeReductionInter, 7.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 5168 NumberOfCodeBlocks, 5168 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5149 ConstructedInterpolants, 0 QuantifiedInterpolants, 2574062 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1057 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 2627/2634 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...