./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label58.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_46cf85bc-7779-4e76-83b5-235e36283d3f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_46cf85bc-7779-4e76-83b5-235e36283d3f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_46cf85bc-7779-4e76-83b5-235e36283d3f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_46cf85bc-7779-4e76-83b5-235e36283d3f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label58.c -s /tmp/vcloud-vcloud-master/worker/run_dir_46cf85bc-7779-4e76-83b5-235e36283d3f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_46cf85bc-7779-4e76-83b5-235e36283d3f/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 bc3f4f83dc0f9722fad67bdaf812b1845d8e1022 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:30:01,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:30:01,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:30:01,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:30:01,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:30:01,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:30:01,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:30:01,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:30:01,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:30:01,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:30:01,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:30:01,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:30:01,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:30:01,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:30:01,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:30:01,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:30:01,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:30:01,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:30:01,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:30:01,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:30:01,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:30:01,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:30:01,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:30:01,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:30:01,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:30:01,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:30:01,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:30:01,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:30:01,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:30:01,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:30:01,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:30:01,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:30:01,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:30:01,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:30:01,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:30:01,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:30:01,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:30:01,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:30:01,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:30:01,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:30:01,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:30:01,428 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_46cf85bc-7779-4e76-83b5-235e36283d3f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:30:01,444 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:30:01,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:30:01,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:30:01,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:30:01,446 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:30:01,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:30:01,447 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:30:01,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:30:01,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:30:01,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:30:01,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:30:01,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:30:01,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:30:01,448 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:30:01,449 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:30:01,449 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:30:01,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:30:01,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:30:01,450 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:30:01,450 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:30:01,450 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:30:01,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:30:01,451 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:30:01,451 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:30:01,451 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:30:01,451 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:30:01,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:30:01,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:30:01,452 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_46cf85bc-7779-4e76-83b5-235e36283d3f/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 -> bc3f4f83dc0f9722fad67bdaf812b1845d8e1022 [2019-11-15 21:30:01,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:30:01,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:30:01,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:30:01,506 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:30:01,506 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:30:01,507 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_46cf85bc-7779-4e76-83b5-235e36283d3f/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label58.c [2019-11-15 21:30:01,579 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_46cf85bc-7779-4e76-83b5-235e36283d3f/bin/uautomizer/data/07cc44ba5/31e2e2e92dbd40c3a7d4f4822f85ac8e/FLAG9e1fbd0a1 [2019-11-15 21:30:02,275 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:30:02,276 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_46cf85bc-7779-4e76-83b5-235e36283d3f/sv-benchmarks/c/eca-rers2012/Problem03_label58.c [2019-11-15 21:30:02,295 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_46cf85bc-7779-4e76-83b5-235e36283d3f/bin/uautomizer/data/07cc44ba5/31e2e2e92dbd40c3a7d4f4822f85ac8e/FLAG9e1fbd0a1 [2019-11-15 21:30:02,450 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_46cf85bc-7779-4e76-83b5-235e36283d3f/bin/uautomizer/data/07cc44ba5/31e2e2e92dbd40c3a7d4f4822f85ac8e [2019-11-15 21:30:02,453 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:30:02,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:30:02,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:30:02,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:30:02,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:30:02,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:30:02" (1/1) ... [2019-11-15 21:30:02,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b6730e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:02, skipping insertion in model container [2019-11-15 21:30:02,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:30:02" (1/1) ... [2019-11-15 21:30:02,476 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:30:02,571 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:30:03,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:30:03,410 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:30:03,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:30:03,714 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:30:03,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:03 WrapperNode [2019-11-15 21:30:03,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:30:03,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:30:03,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:30:03,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:30:03,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:03" (1/1) ... [2019-11-15 21:30:03,765 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:03" (1/1) ... [2019-11-15 21:30:03,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:30:03,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:30:03,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:30:03,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:30:03,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:03" (1/1) ... [2019-11-15 21:30:03,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:03" (1/1) ... [2019-11-15 21:30:03,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:03" (1/1) ... [2019-11-15 21:30:03,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:03" (1/1) ... [2019-11-15 21:30:03,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:03" (1/1) ... [2019-11-15 21:30:03,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:03" (1/1) ... [2019-11-15 21:30:03,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:03" (1/1) ... [2019-11-15 21:30:03,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:30:03,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:30:03,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:30:03,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:30:03,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46cf85bc-7779-4e76-83b5-235e36283d3f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:30:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:30:04,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:30:06,724 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:30:06,725 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:30:06,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:30:06 BoogieIcfgContainer [2019-11-15 21:30:06,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:30:06,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:30:06,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:30:06,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:30:06,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:30:02" (1/3) ... [2019-11-15 21:30:06,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57917bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:30:06, skipping insertion in model container [2019-11-15 21:30:06,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:03" (2/3) ... [2019-11-15 21:30:06,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57917bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:30:06, skipping insertion in model container [2019-11-15 21:30:06,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:30:06" (3/3) ... [2019-11-15 21:30:06,744 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label58.c [2019-11-15 21:30:06,757 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:30:06,767 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:30:06,780 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:30:06,823 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:30:06,824 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:30:06,825 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:30:06,825 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:30:06,825 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:30:06,825 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:30:06,826 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:30:06,826 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:30:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-15 21:30:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-15 21:30:06,876 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:06,877 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:06,879 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:06,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:06,886 INFO L82 PathProgramCache]: Analyzing trace with hash -415972030, now seen corresponding path program 1 times [2019-11-15 21:30:06,895 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:06,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768101582] [2019-11-15 21:30:06,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:06,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:06,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:07,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:30:07,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768101582] [2019-11-15 21:30:07,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:07,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:30:07,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294964448] [2019-11-15 21:30:07,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:30:07,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:07,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:07,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:07,721 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2019-11-15 21:30:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:09,432 INFO L93 Difference]: Finished difference Result 829 states and 1478 transitions. [2019-11-15 21:30:09,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:09,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-11-15 21:30:09,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:09,475 INFO L225 Difference]: With dead ends: 829 [2019-11-15 21:30:09,475 INFO L226 Difference]: Without dead ends: 463 [2019-11-15 21:30:09,486 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-15 21:30:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2019-11-15 21:30:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-15 21:30:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2019-11-15 21:30:09,592 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 160 [2019-11-15 21:30:09,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:09,594 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2019-11-15 21:30:09,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:30:09,594 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2019-11-15 21:30:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-15 21:30:09,600 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:09,600 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:09,600 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:09,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:09,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1978469906, now seen corresponding path program 1 times [2019-11-15 21:30:09,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:09,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492597924] [2019-11-15 21:30:09,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:09,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:09,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:09,771 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-15 21:30:09,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492597924] [2019-11-15 21:30:09,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:09,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:09,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945008077] [2019-11-15 21:30:09,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:30:09,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:09,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:30:09,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:30:09,783 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand 4 states. [2019-11-15 21:30:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:12,023 INFO L93 Difference]: Finished difference Result 1735 states and 2827 transitions. [2019-11-15 21:30:12,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:30:12,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-15 21:30:12,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:12,032 INFO L225 Difference]: With dead ends: 1735 [2019-11-15 21:30:12,033 INFO L226 Difference]: Without dead ends: 1288 [2019-11-15 21:30:12,036 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:30:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2019-11-15 21:30:12,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 859. [2019-11-15 21:30:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-15 21:30:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1315 transitions. [2019-11-15 21:30:12,084 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1315 transitions. Word has length 165 [2019-11-15 21:30:12,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:12,084 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1315 transitions. [2019-11-15 21:30:12,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:30:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1315 transitions. [2019-11-15 21:30:12,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-15 21:30:12,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:12,090 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:12,090 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:12,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:12,091 INFO L82 PathProgramCache]: Analyzing trace with hash 939548030, now seen corresponding path program 1 times [2019-11-15 21:30:12,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:12,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700452659] [2019-11-15 21:30:12,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:12,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:12,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:30:12,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700452659] [2019-11-15 21:30:12,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:12,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:30:12,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364666009] [2019-11-15 21:30:12,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:30:12,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:12,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:12,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:12,230 INFO L87 Difference]: Start difference. First operand 859 states and 1315 transitions. Second operand 3 states. [2019-11-15 21:30:12,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:12,856 INFO L93 Difference]: Finished difference Result 1695 states and 2599 transitions. [2019-11-15 21:30:12,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:12,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-11-15 21:30:12,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:12,863 INFO L225 Difference]: With dead ends: 1695 [2019-11-15 21:30:12,863 INFO L226 Difference]: Without dead ends: 838 [2019-11-15 21:30:12,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:12,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-15 21:30:12,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-11-15 21:30:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-15 21:30:12,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1236 transitions. [2019-11-15 21:30:12,901 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1236 transitions. Word has length 173 [2019-11-15 21:30:12,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:12,901 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1236 transitions. [2019-11-15 21:30:12,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:30:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1236 transitions. [2019-11-15 21:30:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-15 21:30:12,908 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:12,909 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:12,909 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:12,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:12,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1519707828, now seen corresponding path program 1 times [2019-11-15 21:30:12,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:12,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608156889] [2019-11-15 21:30:12,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:12,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:12,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 21:30:13,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608156889] [2019-11-15 21:30:13,051 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:13,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:13,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678432970] [2019-11-15 21:30:13,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:30:13,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:13,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:30:13,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:30:13,054 INFO L87 Difference]: Start difference. First operand 838 states and 1236 transitions. Second operand 4 states. [2019-11-15 21:30:14,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:14,817 INFO L93 Difference]: Finished difference Result 3313 states and 4894 transitions. [2019-11-15 21:30:14,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:30:14,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-15 21:30:14,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:14,835 INFO L225 Difference]: With dead ends: 3313 [2019-11-15 21:30:14,835 INFO L226 Difference]: Without dead ends: 2477 [2019-11-15 21:30:14,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:30:14,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2019-11-15 21:30:14,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 1655. [2019-11-15 21:30:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-11-15 21:30:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2337 transitions. [2019-11-15 21:30:14,889 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2337 transitions. Word has length 174 [2019-11-15 21:30:14,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:14,890 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 2337 transitions. [2019-11-15 21:30:14,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:30:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2337 transitions. [2019-11-15 21:30:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-15 21:30:14,896 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:14,896 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:14,896 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:14,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:14,897 INFO L82 PathProgramCache]: Analyzing trace with hash -774618925, now seen corresponding path program 1 times [2019-11-15 21:30:14,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:14,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033017910] [2019-11-15 21:30:14,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:14,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:14,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 21:30:14,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033017910] [2019-11-15 21:30:15,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:15,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:30:15,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443265804] [2019-11-15 21:30:15,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:30:15,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:15,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:15,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:15,002 INFO L87 Difference]: Start difference. First operand 1655 states and 2337 transitions. Second operand 3 states. [2019-11-15 21:30:15,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:15,937 INFO L93 Difference]: Finished difference Result 4133 states and 5815 transitions. [2019-11-15 21:30:15,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:15,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-11-15 21:30:15,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:15,954 INFO L225 Difference]: With dead ends: 4133 [2019-11-15 21:30:15,955 INFO L226 Difference]: Without dead ends: 2480 [2019-11-15 21:30:15,958 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:15,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2019-11-15 21:30:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2479. [2019-11-15 21:30:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2019-11-15 21:30:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3454 transitions. [2019-11-15 21:30:16,034 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3454 transitions. Word has length 177 [2019-11-15 21:30:16,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:16,034 INFO L462 AbstractCegarLoop]: Abstraction has 2479 states and 3454 transitions. [2019-11-15 21:30:16,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:30:16,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3454 transitions. [2019-11-15 21:30:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-15 21:30:16,041 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:16,042 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:16,042 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:16,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash 686334728, now seen corresponding path program 1 times [2019-11-15 21:30:16,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:16,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865399987] [2019-11-15 21:30:16,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:16,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:16,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 21:30:16,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865399987] [2019-11-15 21:30:16,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:16,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:30:16,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838855166] [2019-11-15 21:30:16,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:30:16,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:16,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:16,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:16,151 INFO L87 Difference]: Start difference. First operand 2479 states and 3454 transitions. Second operand 3 states. [2019-11-15 21:30:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:16,812 INFO L93 Difference]: Finished difference Result 7424 states and 10346 transitions. [2019-11-15 21:30:16,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:16,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-11-15 21:30:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:16,845 INFO L225 Difference]: With dead ends: 7424 [2019-11-15 21:30:16,845 INFO L226 Difference]: Without dead ends: 4947 [2019-11-15 21:30:16,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2019-11-15 21:30:16,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4945. [2019-11-15 21:30:16,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4945 states. [2019-11-15 21:30:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 6884 transitions. [2019-11-15 21:30:16,986 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 6884 transitions. Word has length 180 [2019-11-15 21:30:16,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:16,987 INFO L462 AbstractCegarLoop]: Abstraction has 4945 states and 6884 transitions. [2019-11-15 21:30:16,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:30:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 6884 transitions. [2019-11-15 21:30:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-15 21:30:16,995 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:16,995 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:16,995 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:16,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:16,997 INFO L82 PathProgramCache]: Analyzing trace with hash -494215325, now seen corresponding path program 1 times [2019-11-15 21:30:16,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:16,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954624664] [2019-11-15 21:30:16,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:16,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:16,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:30:17,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954624664] [2019-11-15 21:30:17,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:17,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:17,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835535232] [2019-11-15 21:30:17,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:30:17,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:17,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:17,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:17,093 INFO L87 Difference]: Start difference. First operand 4945 states and 6884 transitions. Second operand 3 states. [2019-11-15 21:30:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:18,246 INFO L93 Difference]: Finished difference Result 14560 states and 20285 transitions. [2019-11-15 21:30:18,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:18,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-11-15 21:30:18,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:18,313 INFO L225 Difference]: With dead ends: 14560 [2019-11-15 21:30:18,313 INFO L226 Difference]: Without dead ends: 9617 [2019-11-15 21:30:18,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9617 states. [2019-11-15 21:30:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9617 to 9615. [2019-11-15 21:30:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9615 states. [2019-11-15 21:30:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 12493 transitions. [2019-11-15 21:30:18,539 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 12493 transitions. Word has length 182 [2019-11-15 21:30:18,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:18,540 INFO L462 AbstractCegarLoop]: Abstraction has 9615 states and 12493 transitions. [2019-11-15 21:30:18,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:30:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 12493 transitions. [2019-11-15 21:30:18,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-15 21:30:18,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:18,553 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:18,554 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:18,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:18,554 INFO L82 PathProgramCache]: Analyzing trace with hash -227827320, now seen corresponding path program 2 times [2019-11-15 21:30:18,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:18,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300155931] [2019-11-15 21:30:18,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:18,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:18,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:30:18,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300155931] [2019-11-15 21:30:18,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:18,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:18,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365217589] [2019-11-15 21:30:18,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:30:18,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:18,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:18,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:18,644 INFO L87 Difference]: Start difference. First operand 9615 states and 12493 transitions. Second operand 3 states. [2019-11-15 21:30:19,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:19,978 INFO L93 Difference]: Finished difference Result 26540 states and 34559 transitions. [2019-11-15 21:30:19,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:19,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-15 21:30:19,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:20,039 INFO L225 Difference]: With dead ends: 26540 [2019-11-15 21:30:20,039 INFO L226 Difference]: Without dead ends: 16927 [2019-11-15 21:30:20,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16927 states. [2019-11-15 21:30:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16927 to 16923. [2019-11-15 21:30:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-11-15 21:30:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 20089 transitions. [2019-11-15 21:30:20,386 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 20089 transitions. Word has length 184 [2019-11-15 21:30:20,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:20,388 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 20089 transitions. [2019-11-15 21:30:20,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:30:20,388 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 20089 transitions. [2019-11-15 21:30:20,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-15 21:30:20,409 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:20,409 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:30:20,410 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:20,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:20,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1910647691, now seen corresponding path program 1 times [2019-11-15 21:30:20,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:20,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753520748] [2019-11-15 21:30:20,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:20,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:20,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:20,516 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 21:30:20,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753520748] [2019-11-15 21:30:20,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:20,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:20,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285007136] [2019-11-15 21:30:20,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:30:20,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:20,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:30:20,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:30:20,521 INFO L87 Difference]: Start difference. First operand 16923 states and 20089 transitions. Second operand 4 states. [2019-11-15 21:30:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:21,780 INFO L93 Difference]: Finished difference Result 33846 states and 40180 transitions. [2019-11-15 21:30:21,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:21,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-11-15 21:30:21,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:21,821 INFO L225 Difference]: With dead ends: 33846 [2019-11-15 21:30:21,821 INFO L226 Difference]: Without dead ends: 16925 [2019-11-15 21:30:21,844 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:30:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16925 states. [2019-11-15 21:30:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16925 to 16923. [2019-11-15 21:30:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-11-15 21:30:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 19544 transitions. [2019-11-15 21:30:22,177 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 19544 transitions. Word has length 202 [2019-11-15 21:30:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:22,178 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 19544 transitions. [2019-11-15 21:30:22,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:30:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 19544 transitions. [2019-11-15 21:30:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-15 21:30:22,207 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:22,207 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:22,208 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:22,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:22,208 INFO L82 PathProgramCache]: Analyzing trace with hash -842943628, now seen corresponding path program 1 times [2019-11-15 21:30:22,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:22,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707969216] [2019-11-15 21:30:22,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:22,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:22,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 21:30:22,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707969216] [2019-11-15 21:30:22,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:22,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:30:22,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029967284] [2019-11-15 21:30:22,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:30:22,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:22,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:30:22,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:30:22,594 INFO L87 Difference]: Start difference. First operand 16923 states and 19544 transitions. Second operand 5 states. [2019-11-15 21:30:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:24,922 INFO L93 Difference]: Finished difference Result 77631 states and 89804 transitions. [2019-11-15 21:30:24,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:30:24,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 227 [2019-11-15 21:30:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:25,102 INFO L225 Difference]: With dead ends: 77631 [2019-11-15 21:30:25,102 INFO L226 Difference]: Without dead ends: 60710 [2019-11-15 21:30:25,137 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:30:25,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60710 states. [2019-11-15 21:30:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60710 to 60704. [2019-11-15 21:30:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60704 states. [2019-11-15 21:30:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60704 states to 60704 states and 70206 transitions. [2019-11-15 21:30:26,402 INFO L78 Accepts]: Start accepts. Automaton has 60704 states and 70206 transitions. Word has length 227 [2019-11-15 21:30:26,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:26,402 INFO L462 AbstractCegarLoop]: Abstraction has 60704 states and 70206 transitions. [2019-11-15 21:30:26,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:30:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 60704 states and 70206 transitions. [2019-11-15 21:30:26,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-15 21:30:26,423 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:26,425 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:30:26,425 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:26,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:26,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1840322684, now seen corresponding path program 1 times [2019-11-15 21:30:26,426 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:26,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129462598] [2019-11-15 21:30:26,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:26,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:26,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:26,584 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:30:26,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129462598] [2019-11-15 21:30:26,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:26,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:26,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729893048] [2019-11-15 21:30:26,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:30:26,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:26,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:26,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:26,587 INFO L87 Difference]: Start difference. First operand 60704 states and 70206 transitions. Second operand 3 states. [2019-11-15 21:30:28,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:28,277 INFO L93 Difference]: Finished difference Result 143587 states and 166565 transitions. [2019-11-15 21:30:28,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:28,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-11-15 21:30:28,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:28,410 INFO L225 Difference]: With dead ends: 143587 [2019-11-15 21:30:28,410 INFO L226 Difference]: Without dead ends: 82885 [2019-11-15 21:30:28,474 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:28,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82885 states. [2019-11-15 21:30:30,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82885 to 82831. [2019-11-15 21:30:30,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82831 states. [2019-11-15 21:30:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82831 states to 82831 states and 95016 transitions. [2019-11-15 21:30:30,174 INFO L78 Accepts]: Start accepts. Automaton has 82831 states and 95016 transitions. Word has length 230 [2019-11-15 21:30:30,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:30,174 INFO L462 AbstractCegarLoop]: Abstraction has 82831 states and 95016 transitions. [2019-11-15 21:30:30,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:30:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 82831 states and 95016 transitions. [2019-11-15 21:30:30,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-11-15 21:30:30,196 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:30,197 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:30:30,197 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:30,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:30,198 INFO L82 PathProgramCache]: Analyzing trace with hash 606323975, now seen corresponding path program 1 times [2019-11-15 21:30:30,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:30,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671821506] [2019-11-15 21:30:30,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:30,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:30,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 86 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 21:30:30,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671821506] [2019-11-15 21:30:30,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912789871] [2019-11-15 21:30:30,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46cf85bc-7779-4e76-83b5-235e36283d3f/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:30:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:30,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:30:30,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:30:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:30:30,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:30:30,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-15 21:30:30,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730244483] [2019-11-15 21:30:30,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:30:30,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:30,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:30,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:30:30,691 INFO L87 Difference]: Start difference. First operand 82831 states and 95016 transitions. Second operand 3 states. [2019-11-15 21:30:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:32,630 INFO L93 Difference]: Finished difference Result 161604 states and 185341 transitions. [2019-11-15 21:30:32,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:32,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-11-15 21:30:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:32,746 INFO L225 Difference]: With dead ends: 161604 [2019-11-15 21:30:32,746 INFO L226 Difference]: Without dead ends: 78775 [2019-11-15 21:30:32,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:30:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78775 states. [2019-11-15 21:30:33,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78775 to 72876. [2019-11-15 21:30:33,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72876 states. [2019-11-15 21:30:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72876 states to 72876 states and 81908 transitions. [2019-11-15 21:30:33,757 INFO L78 Accepts]: Start accepts. Automaton has 72876 states and 81908 transitions. Word has length 238 [2019-11-15 21:30:33,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:33,758 INFO L462 AbstractCegarLoop]: Abstraction has 72876 states and 81908 transitions. [2019-11-15 21:30:33,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:30:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 72876 states and 81908 transitions. [2019-11-15 21:30:33,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-15 21:30:33,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:33,783 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:30:33,987 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:30:33,987 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:33,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:33,988 INFO L82 PathProgramCache]: Analyzing trace with hash -801056395, now seen corresponding path program 1 times [2019-11-15 21:30:33,988 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:33,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704615273] [2019-11-15 21:30:33,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:33,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:33,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 21:30:34,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704615273] [2019-11-15 21:30:34,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:34,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:30:34,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502152701] [2019-11-15 21:30:34,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:30:34,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:34,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:34,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:34,263 INFO L87 Difference]: Start difference. First operand 72876 states and 81908 transitions. Second operand 3 states. [2019-11-15 21:30:35,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:35,934 INFO L93 Difference]: Finished difference Result 214341 states and 240595 transitions. [2019-11-15 21:30:35,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:35,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-11-15 21:30:35,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:36,097 INFO L225 Difference]: With dead ends: 214341 [2019-11-15 21:30:36,098 INFO L226 Difference]: Without dead ends: 141467 [2019-11-15 21:30:36,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141467 states. [2019-11-15 21:30:37,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141467 to 141465. [2019-11-15 21:30:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141465 states. [2019-11-15 21:30:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141465 states to 141465 states and 158679 transitions. [2019-11-15 21:30:37,597 INFO L78 Accepts]: Start accepts. Automaton has 141465 states and 158679 transitions. Word has length 300 [2019-11-15 21:30:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:37,598 INFO L462 AbstractCegarLoop]: Abstraction has 141465 states and 158679 transitions. [2019-11-15 21:30:37,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:30:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 141465 states and 158679 transitions. [2019-11-15 21:30:37,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-11-15 21:30:37,657 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:37,657 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:37,657 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:37,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:37,658 INFO L82 PathProgramCache]: Analyzing trace with hash 871529716, now seen corresponding path program 1 times [2019-11-15 21:30:37,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:37,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836592349] [2019-11-15 21:30:37,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 21:30:38,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836592349] [2019-11-15 21:30:38,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:38,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:38,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775001295] [2019-11-15 21:30:38,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:30:38,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:38,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:38,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:38,944 INFO L87 Difference]: Start difference. First operand 141465 states and 158679 transitions. Second operand 3 states. [2019-11-15 21:30:41,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:41,121 INFO L93 Difference]: Finished difference Result 321518 states and 362081 transitions. [2019-11-15 21:30:41,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:41,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 367 [2019-11-15 21:30:41,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:41,123 INFO L225 Difference]: With dead ends: 321518 [2019-11-15 21:30:41,123 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:30:41,221 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:30:41,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:30:41,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:30:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:30:41,223 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 367 [2019-11-15 21:30:41,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:41,223 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:30:41,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:30:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:30:41,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:30:41,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:30:49,215 WARN L191 SmtUtils]: Spent 7.97 s on a formula simplification. DAG size of input: 969 DAG size of output: 339 [2019-11-15 21:30:53,603 WARN L191 SmtUtils]: Spent 4.38 s on a formula simplification. DAG size of input: 969 DAG size of output: 339 [2019-11-15 21:30:57,529 WARN L191 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 335 DAG size of output: 57 [2019-11-15 21:31:01,114 WARN L191 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 335 DAG size of output: 57 [2019-11-15 21:31:01,116 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-15 21:31:01,116 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-15 21:31:01,116 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,116 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,117 INFO L443 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,117 INFO L443 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,117 INFO L443 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,117 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,117 INFO L443 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,117 INFO L443 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-15 21:31:01,117 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,117 INFO L443 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-15 21:31:01,118 INFO L443 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-15 21:31:01,118 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,118 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,118 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,118 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,118 INFO L443 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-15 21:31:01,118 INFO L443 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-15 21:31:01,118 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,118 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,118 INFO L443 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,118 INFO L443 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,119 INFO L443 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,119 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,119 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,119 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,119 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,119 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,119 INFO L443 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-15 21:31:01,119 INFO L443 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-15 21:31:01,119 INFO L443 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-15 21:31:01,119 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,119 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,119 INFO L443 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,120 INFO L443 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,120 INFO L443 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,120 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,120 INFO L443 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-15 21:31:01,120 INFO L443 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-15 21:31:01,120 INFO L443 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-15 21:31:01,120 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,120 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,120 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,120 INFO L443 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,120 INFO L443 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,120 INFO L443 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,121 INFO L443 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-15 21:31:01,121 INFO L443 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-15 21:31:01,121 INFO L443 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-15 21:31:01,121 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,121 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,121 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,121 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-15 21:31:01,121 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,121 INFO L443 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-15 21:31:01,121 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,121 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,122 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-15 21:31:01,122 INFO L443 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-15 21:31:01,122 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,122 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,122 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,122 INFO L443 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,122 INFO L443 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,122 INFO L443 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,122 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,122 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-15 21:31:01,122 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-15 21:31:01,122 INFO L443 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-15 21:31:01,123 INFO L443 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-15 21:31:01,123 INFO L443 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-15 21:31:01,123 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,123 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,123 INFO L443 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,123 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,123 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,123 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,124 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,124 INFO L443 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,124 INFO L443 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,124 INFO L443 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,124 INFO L443 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-15 21:31:01,124 INFO L443 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-15 21:31:01,125 INFO L443 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-15 21:31:01,125 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,125 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,125 INFO L443 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,125 INFO L443 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,126 INFO L443 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,126 INFO L443 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,126 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,126 INFO L443 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,126 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,126 INFO L443 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-15 21:31:01,127 INFO L443 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-15 21:31:01,127 INFO L443 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-15 21:31:01,127 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-15 21:31:01,127 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-15 21:31:01,127 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,128 INFO L443 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,128 INFO L443 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,128 INFO L443 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,128 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,128 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:31:01,128 INFO L443 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,129 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,129 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,129 INFO L443 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-15 21:31:01,129 INFO L443 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-15 21:31:01,129 INFO L443 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-15 21:31:01,130 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,130 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,130 INFO L443 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,130 INFO L443 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-15 21:31:01,130 INFO L443 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-15 21:31:01,131 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,131 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,131 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,131 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-15 21:31:01,131 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,132 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-15 21:31:01,132 INFO L443 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,132 INFO L443 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-15 21:31:01,132 INFO L443 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,132 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,132 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-15 21:31:01,133 INFO L443 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-15 21:31:01,133 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-15 21:31:01,133 INFO L443 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-15 21:31:01,133 INFO L443 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-15 21:31:01,133 INFO L443 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-15 21:31:01,134 INFO L443 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-15 21:31:01,134 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,134 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,134 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,135 INFO L439 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse10 (= 1 ~a6~0))) (let ((.cse13 (not .cse10)) (.cse4 (= ~a5~0 1)) (.cse5 (= ~a27~0 1)) (.cse15 (not (= ~a12~0 1)))) (let ((.cse9 (and .cse5 .cse15)) (.cse2 (and .cse13 .cse4)) (.cse3 (<= ~a3~0 0)) (.cse14 (not (= ~a7~0 1))) (.cse12 (= 2 ~a3~0)) (.cse0 (= ~a11~0 1)) (.cse7 (= ~a16~0 1)) (.cse1 (= ~a26~0 1)) (.cse11 (and .cse15 .cse13 .cse4)) (.cse6 (= 1 ~a10~0)) (.cse8 (<= ~a11~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse1) (and .cse5 .cse6 .cse4 .cse0 .cse1 .cse7) (and .cse3 .cse8 .cse4 .cse7) (and .cse8 .cse9 .cse4) (and .cse9 .cse4 .cse0) (and (= ~a13~0 1) .cse10 .cse4 .cse0 .cse7) (and .cse11 .cse8 .cse1) (and .cse5 .cse6 .cse8 .cse12 .cse4) (and .cse8 .cse12 .cse1 .cse2) (and .cse3 .cse8 .cse2) (and (and .cse5 .cse13 .cse4) .cse8 .cse12) (and .cse3 .cse5 .cse10 .cse4 .cse0) (and .cse14 .cse5 .cse10 .cse6 .cse4 .cse0 .cse7) (and .cse15 .cse10 .cse8 .cse12 .cse4) (and .cse15 .cse4 .cse0 .cse1) (and .cse14 .cse10 .cse6 .cse8 .cse4) (and .cse11 .cse12 .cse0) (and .cse5 .cse12 .cse4 .cse0 .cse1 .cse7) (and .cse10 .cse8 .cse4 .cse1) (and .cse5 .cse8 .cse4 .cse1) (and .cse11 .cse6 .cse8))))) [2019-11-15 21:31:01,135 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,136 INFO L443 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,136 INFO L443 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,136 INFO L443 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-15 21:31:01,136 INFO L443 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-15 21:31:01,136 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,136 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,137 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:31:01,137 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,137 INFO L446 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-15 21:31:01,137 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,137 INFO L443 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,138 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,138 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,138 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,138 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,138 INFO L443 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-15 21:31:01,138 INFO L443 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-15 21:31:01,139 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,139 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,139 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,139 INFO L443 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,139 INFO L443 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,140 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,140 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,140 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,140 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,140 INFO L443 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-15 21:31:01,141 INFO L443 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-15 21:31:01,141 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,141 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,141 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-15 21:31:01,141 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-15 21:31:01,142 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,142 INFO L439 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse10 (= 1 ~a6~0))) (let ((.cse13 (not .cse10)) (.cse4 (= ~a5~0 1)) (.cse5 (= ~a27~0 1)) (.cse15 (not (= ~a12~0 1)))) (let ((.cse9 (and .cse5 .cse15)) (.cse2 (and .cse13 .cse4)) (.cse3 (<= ~a3~0 0)) (.cse14 (not (= ~a7~0 1))) (.cse12 (= 2 ~a3~0)) (.cse0 (= ~a11~0 1)) (.cse7 (= ~a16~0 1)) (.cse1 (= ~a26~0 1)) (.cse11 (and .cse15 .cse13 .cse4)) (.cse6 (= 1 ~a10~0)) (.cse8 (<= ~a11~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse1) (and .cse5 .cse6 .cse4 .cse0 .cse1 .cse7) (and .cse3 .cse8 .cse4 .cse7) (and .cse8 .cse9 .cse4) (and .cse9 .cse4 .cse0) (and (= ~a13~0 1) .cse10 .cse4 .cse0 .cse7) (and .cse11 .cse8 .cse1) (and .cse5 .cse6 .cse8 .cse12 .cse4) (and .cse8 .cse12 .cse1 .cse2) (and .cse3 .cse8 .cse2) (and (and .cse5 .cse13 .cse4) .cse8 .cse12) (and .cse3 .cse5 .cse10 .cse4 .cse0) (and .cse14 .cse5 .cse10 .cse6 .cse4 .cse0 .cse7) (and .cse15 .cse10 .cse8 .cse12 .cse4) (and .cse15 .cse4 .cse0 .cse1) (and .cse14 .cse10 .cse6 .cse8 .cse4) (and .cse11 .cse12 .cse0) (and .cse5 .cse12 .cse4 .cse0 .cse1 .cse7) (and .cse10 .cse8 .cse4 .cse1) (and .cse5 .cse8 .cse4 .cse1) (and .cse11 .cse6 .cse8))))) [2019-11-15 21:31:01,142 INFO L443 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,142 INFO L443 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,143 INFO L443 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,143 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,143 INFO L443 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-15 21:31:01,143 INFO L443 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-15 21:31:01,143 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,143 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,144 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,144 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,144 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,144 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,144 INFO L443 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,145 INFO L443 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,145 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-15 21:31:01,145 INFO L443 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-15 21:31:01,145 INFO L443 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-15 21:31:01,145 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,146 INFO L443 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-15 21:31:01,146 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,146 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,146 INFO L443 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-15 21:31:01,146 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,146 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,147 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,147 INFO L443 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,147 INFO L443 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,147 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-15 21:31:01,147 INFO L443 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,147 INFO L443 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-15 21:31:01,148 INFO L443 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-15 21:31:01,148 INFO L443 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-15 21:31:01,148 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,148 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,148 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,149 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,149 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,149 INFO L443 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,149 INFO L443 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,149 INFO L443 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,149 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-15 21:31:01,150 INFO L443 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-15 21:31:01,150 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,150 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,150 INFO L443 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-15 21:31:01,150 INFO L443 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-15 21:31:01,151 INFO L443 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-15 21:31:01,151 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,151 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,151 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,151 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,151 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,152 INFO L443 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,152 INFO L443 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,152 INFO L443 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,152 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,152 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,152 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,153 INFO L443 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-15 21:31:01,153 INFO L443 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-15 21:31:01,153 INFO L443 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-15 21:31:01,153 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:31:01,153 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,154 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,154 INFO L443 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,154 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,154 INFO L443 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,154 INFO L443 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,154 INFO L443 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,155 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-15 21:31:01,155 INFO L443 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-15 21:31:01,155 INFO L443 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,155 INFO L443 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-15 21:31:01,155 INFO L443 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-15 21:31:01,155 INFO L443 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-15 21:31:01,156 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,156 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,156 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,156 INFO L443 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,156 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,157 INFO L443 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-15 21:31:01,157 INFO L443 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-15 21:31:01,157 INFO L443 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,157 INFO L443 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,157 INFO L443 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,158 INFO L443 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-15 21:31:01,158 INFO L443 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-15 21:31:01,158 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,158 INFO L443 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-15 21:31:01,158 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,158 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,159 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,159 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,159 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,159 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,159 INFO L443 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,160 INFO L443 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,160 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,160 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,160 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:31:01,160 INFO L443 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-15 21:31:01,160 INFO L443 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-15 21:31:01,161 INFO L443 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-15 21:31:01,161 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,161 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-15 21:31:01,161 INFO L443 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-15 21:31:01,161 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,161 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,162 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,162 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,162 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,162 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,162 INFO L443 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,163 INFO L443 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,163 INFO L443 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,163 INFO L443 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-15 21:31:01,163 INFO L443 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-15 21:31:01,163 INFO L443 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-15 21:31:01,163 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,164 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,164 INFO L443 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,164 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,164 INFO L443 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:31:01,164 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1515) no Hoare annotation was computed. [2019-11-15 21:31:01,165 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,165 INFO L443 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-15 21:31:01,165 INFO L443 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-15 21:31:01,165 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,165 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-15 21:31:01,165 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-15 21:31:01,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:31:01 BoogieIcfgContainer [2019-11-15 21:31:01,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:31:01,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:31:01,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:31:01,209 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:31:01,209 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:30:06" (3/4) ... [2019-11-15 21:31:01,213 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:31:01,253 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 21:31:01,257 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:31:01,657 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_46cf85bc-7779-4e76-83b5-235e36283d3f/bin/uautomizer/witness.graphml [2019-11-15 21:31:01,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:31:01,659 INFO L168 Benchmark]: Toolchain (without parser) took 59204.71 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.1 GB). Free memory was 940.7 MB in the beginning and 1.9 GB in the end (delta: -991.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-15 21:31:01,659 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:31:01,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1254.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -111.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:31:01,660 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:31:01,661 INFO L168 Benchmark]: Boogie Preprocessor took 108.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:31:01,661 INFO L168 Benchmark]: RCFGBuilder took 2769.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.0 MB). Peak memory consumption was 189.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:31:01,662 INFO L168 Benchmark]: TraceAbstraction took 54480.06 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -987.3 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-11-15 21:31:01,663 INFO L168 Benchmark]: Witness Printer took 449.49 ms. Allocated memory is still 4.1 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:31:01,665 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.37 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1254.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -111.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 131.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 108.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2769.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.0 MB). Peak memory consumption was 189.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 54480.06 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -987.3 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 449.49 ms. Allocated memory is still 4.1 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1515]: 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: ((((((((((((((((((((((a11 == 1 && a26 == 1) && !(1 == a6) && a5 == 1) || (((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1)) || (((((a27 == 1 && 1 == a10) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((a3 <= 0 && a11 <= 0) && a5 == 1) && a16 == 1)) || ((a11 <= 0 && a27 == 1 && !(a12 == 1)) && a5 == 1)) || (((a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1)) || ((((a13 == 1 && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && a11 <= 0) && a26 == 1)) || ((((a27 == 1 && 1 == a10) && a11 <= 0) && 2 == a3) && a5 == 1)) || (((a11 <= 0 && 2 == a3) && a26 == 1) && !(1 == a6) && a5 == 1)) || ((a3 <= 0 && a11 <= 0) && !(1 == a6) && a5 == 1)) || ((((a27 == 1 && !(1 == a6)) && a5 == 1) && a11 <= 0) && 2 == a3)) || ((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1)) || ((((((!(a7 == 1) && a27 == 1) && 1 == a6) && 1 == a10) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && 2 == a3) && a5 == 1)) || (((!(a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((!(a7 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a5 == 1)) || ((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 2 == a3) && a11 == 1)) || (((((a27 == 1 && 2 == a3) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((1 == a6 && a11 <= 0) && a5 == 1) && a26 == 1)) || (((a27 == 1 && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a10) && a11 <= 0) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((a11 == 1 && a26 == 1) && !(1 == a6) && a5 == 1) || (((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1)) || (((((a27 == 1 && 1 == a10) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((a3 <= 0 && a11 <= 0) && a5 == 1) && a16 == 1)) || ((a11 <= 0 && a27 == 1 && !(a12 == 1)) && a5 == 1)) || (((a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1)) || ((((a13 == 1 && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && a11 <= 0) && a26 == 1)) || ((((a27 == 1 && 1 == a10) && a11 <= 0) && 2 == a3) && a5 == 1)) || (((a11 <= 0 && 2 == a3) && a26 == 1) && !(1 == a6) && a5 == 1)) || ((a3 <= 0 && a11 <= 0) && !(1 == a6) && a5 == 1)) || ((((a27 == 1 && !(1 == a6)) && a5 == 1) && a11 <= 0) && 2 == a3)) || ((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1)) || ((((((!(a7 == 1) && a27 == 1) && 1 == a6) && 1 == a10) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && 2 == a3) && a5 == 1)) || (((!(a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((!(a7 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a5 == 1)) || ((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 2 == a3) && a11 == 1)) || (((((a27 == 1 && 2 == a3) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((1 == a6 && a11 <= 0) && a5 == 1) && a26 == 1)) || (((a27 == 1 && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a10) && a11 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 54.3s, OverallIterations: 14, TraceHistogramMax: 5, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.8s, HoareTripleCheckerStatistics: 2775 SDtfs, 5164 SDslu, 1379 SDs, 0 SdLazy, 7938 SolverSat, 1753 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 255 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141465occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 7237 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1735 NumberOfFragments, 727 HoareAnnotationTreeSize, 3 FomulaSimplifications, 52120 FormulaSimplificationTreeSizeReduction, 12.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 25822 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 3197 NumberOfCodeBlocks, 3197 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3182 ConstructedInterpolants, 0 QuantifiedInterpolants, 1080766 SizeOfPredicates, 0 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1102/1105 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...