./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.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_2c13cb6b-044f-4c89-b22f-944d7d3f1e8b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2c13cb6b-044f-4c89-b22f-944d7d3f1e8b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2c13cb6b-044f-4c89-b22f-944d7d3f1e8b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2c13cb6b-044f-4c89-b22f-944d7d3f1e8b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2c13cb6b-044f-4c89-b22f-944d7d3f1e8b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2c13cb6b-044f-4c89-b22f-944d7d3f1e8b/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 b38413ca0cda685b7a25d67b5b16f20b69a9d320 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 23:36:03,117 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:36:03,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:36:03,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:36:03,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:36:03,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:36:03,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:36:03,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:36:03,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:36:03,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:36:03,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:36:03,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:36:03,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:36:03,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:36:03,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:36:03,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:36:03,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:36:03,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:36:03,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:36:03,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:36:03,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:36:03,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:36:03,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:36:03,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:36:03,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:36:03,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:36:03,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:36:03,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:36:03,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:36:03,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:36:03,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:36:03,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:36:03,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:36:03,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:36:03,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:36:03,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:36:03,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:36:03,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:36:03,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:36:03,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:36:03,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:36:03,165 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2c13cb6b-044f-4c89-b22f-944d7d3f1e8b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:36:03,188 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:36:03,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:36:03,190 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:36:03,190 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:36:03,190 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:36:03,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:36:03,191 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:36:03,191 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:36:03,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:36:03,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:36:03,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:36:03,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:36:03,193 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:36:03,193 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:36:03,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:36:03,193 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:36:03,194 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:36:03,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:36:03,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:36:03,195 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:36:03,195 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:36:03,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:36:03,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:36:03,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:36:03,196 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:36:03,196 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:36:03,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:36:03,196 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:36:03,197 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_2c13cb6b-044f-4c89-b22f-944d7d3f1e8b/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 -> b38413ca0cda685b7a25d67b5b16f20b69a9d320 [2019-11-15 23:36:03,257 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:36:03,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:36:03,272 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:36:03,273 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:36:03,274 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:36:03,274 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2c13cb6b-044f-4c89-b22f-944d7d3f1e8b/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-11-15 23:36:03,335 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2c13cb6b-044f-4c89-b22f-944d7d3f1e8b/bin/uautomizer/data/decf5b259/065bcf42ff114270895b7b6816d9da93/FLAG4227d26aa [2019-11-15 23:36:03,942 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:36:03,943 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2c13cb6b-044f-4c89-b22f-944d7d3f1e8b/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-11-15 23:36:03,978 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2c13cb6b-044f-4c89-b22f-944d7d3f1e8b/bin/uautomizer/data/decf5b259/065bcf42ff114270895b7b6816d9da93/FLAG4227d26aa [2019-11-15 23:36:04,184 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2c13cb6b-044f-4c89-b22f-944d7d3f1e8b/bin/uautomizer/data/decf5b259/065bcf42ff114270895b7b6816d9da93 [2019-11-15 23:36:04,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:36:04,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:36:04,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:36:04,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:36:04,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:36:04,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:36:04" (1/1) ... [2019-11-15 23:36:04,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7464cab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:04, skipping insertion in model container [2019-11-15 23:36:04,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:36:04" (1/1) ... [2019-11-15 23:36:04,212 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:36:04,316 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:36:05,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:36:05,106 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:36:05,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:36:05,447 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:36:05,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:05 WrapperNode [2019-11-15 23:36:05,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:36:05,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:36:05,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:36:05,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:36:05,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:05" (1/1) ... [2019-11-15 23:36:05,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:05" (1/1) ... [2019-11-15 23:36:05,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:36:05,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:36:05,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:36:05,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:36:05,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:05" (1/1) ... [2019-11-15 23:36:05,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:05" (1/1) ... [2019-11-15 23:36:05,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:05" (1/1) ... [2019-11-15 23:36:05,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:05" (1/1) ... [2019-11-15 23:36:05,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:05" (1/1) ... [2019-11-15 23:36:05,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:05" (1/1) ... [2019-11-15 23:36:05,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:05" (1/1) ... [2019-11-15 23:36:05,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:36:05,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:36:05,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:36:05,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:36:05,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c13cb6b-044f-4c89-b22f-944d7d3f1e8b/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 23:36:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:36:05,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:36:08,322 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:36:08,323 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 23:36:08,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:08 BoogieIcfgContainer [2019-11-15 23:36:08,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:36:08,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:36:08,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:36:08,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:36:08,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:36:04" (1/3) ... [2019-11-15 23:36:08,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca39103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:36:08, skipping insertion in model container [2019-11-15 23:36:08,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:05" (2/3) ... [2019-11-15 23:36:08,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca39103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:36:08, skipping insertion in model container [2019-11-15 23:36:08,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:08" (3/3) ... [2019-11-15 23:36:08,332 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2019-11-15 23:36:08,342 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:36:08,353 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-15 23:36:08,368 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-15 23:36:08,397 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:36:08,397 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:36:08,397 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:36:08,397 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:36:08,397 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:36:08,397 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:36:08,398 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:36:08,398 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:36:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states. [2019-11-15 23:36:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 23:36:08,435 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:08,435 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:36:08,438 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:08,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:08,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2019-11-15 23:36:08,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:08,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974379839] [2019-11-15 23:36:08,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:08,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:08,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:08,631 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 23:36:08,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974379839] [2019-11-15 23:36:08,632 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:08,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:36:08,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728815278] [2019-11-15 23:36:08,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:36:08,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:08,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:36:08,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:36:08,653 INFO L87 Difference]: Start difference. First operand 475 states. Second operand 4 states. [2019-11-15 23:36:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:09,927 INFO L93 Difference]: Finished difference Result 486 states and 909 transitions. [2019-11-15 23:36:09,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:36:09,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 23:36:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:09,940 INFO L225 Difference]: With dead ends: 486 [2019-11-15 23:36:09,940 INFO L226 Difference]: Without dead ends: 297 [2019-11-15 23:36:09,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:36:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-15 23:36:09,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2019-11-15 23:36:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-11-15 23:36:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2019-11-15 23:36:09,998 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 7 [2019-11-15 23:36:09,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:09,999 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2019-11-15 23:36:09,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:36:09,999 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2019-11-15 23:36:09,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-15 23:36:09,999 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:09,999 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:36:10,000 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:10,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:10,000 INFO L82 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2019-11-15 23:36:10,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:10,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190694021] [2019-11-15 23:36:10,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:10,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:10,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:10,039 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 23:36:10,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190694021] [2019-11-15 23:36:10,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:10,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:36:10,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806264839] [2019-11-15 23:36:10,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:36:10,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:10,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:36:10,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:36:10,042 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand 4 states. [2019-11-15 23:36:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:10,419 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2019-11-15 23:36:10,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:36:10,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-15 23:36:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:10,424 INFO L225 Difference]: With dead ends: 297 [2019-11-15 23:36:10,424 INFO L226 Difference]: Without dead ends: 292 [2019-11-15 23:36:10,425 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:36:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-15 23:36:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-11-15 23:36:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-15 23:36:10,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 295 transitions. [2019-11-15 23:36:10,442 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 295 transitions. Word has length 8 [2019-11-15 23:36:10,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:10,442 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 295 transitions. [2019-11-15 23:36:10,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:36:10,442 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 295 transitions. [2019-11-15 23:36:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-15 23:36:10,451 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:10,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:10,452 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:10,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:10,452 INFO L82 PathProgramCache]: Analyzing trace with hash 943449897, now seen corresponding path program 1 times [2019-11-15 23:36:10,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:10,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575586717] [2019-11-15 23:36:10,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:10,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:10,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:13,453 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 23:36:13,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575586717] [2019-11-15 23:36:13,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:13,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2019-11-15 23:36:13,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697795903] [2019-11-15 23:36:13,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-11-15 23:36:13,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:13,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-11-15 23:36:13,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2019-11-15 23:36:13,459 INFO L87 Difference]: Start difference. First operand 292 states and 295 transitions. Second operand 62 states. [2019-11-15 23:36:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:14,894 INFO L93 Difference]: Finished difference Result 293 states and 296 transitions. [2019-11-15 23:36:14,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-11-15 23:36:14,895 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 244 [2019-11-15 23:36:14,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:14,898 INFO L225 Difference]: With dead ends: 293 [2019-11-15 23:36:14,899 INFO L226 Difference]: Without dead ends: 291 [2019-11-15 23:36:14,901 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2019-11-15 23:36:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-15 23:36:14,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 290. [2019-11-15 23:36:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-11-15 23:36:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 293 transitions. [2019-11-15 23:36:14,942 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 293 transitions. Word has length 244 [2019-11-15 23:36:14,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:14,943 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 293 transitions. [2019-11-15 23:36:14,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-11-15 23:36:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 293 transitions. [2019-11-15 23:36:14,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-15 23:36:14,953 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:14,953 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:14,954 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:14,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:14,955 INFO L82 PathProgramCache]: Analyzing trace with hash -817818172, now seen corresponding path program 1 times [2019-11-15 23:36:14,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:14,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334132719] [2019-11-15 23:36:14,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:14,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:14,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:16,157 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 23:36:16,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334132719] [2019-11-15 23:36:16,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:16,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:36:16,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344791529] [2019-11-15 23:36:16,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:36:16,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:16,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:36:16,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:36:16,160 INFO L87 Difference]: Start difference. First operand 290 states and 293 transitions. Second operand 5 states. [2019-11-15 23:36:16,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:16,698 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-11-15 23:36:16,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:36:16,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-11-15 23:36:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:16,701 INFO L225 Difference]: With dead ends: 292 [2019-11-15 23:36:16,701 INFO L226 Difference]: Without dead ends: 290 [2019-11-15 23:36:16,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 62 SyntacticMatches, 117 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:36:16,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-11-15 23:36:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2019-11-15 23:36:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-11-15 23:36:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 291 transitions. [2019-11-15 23:36:16,713 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 291 transitions. Word has length 245 [2019-11-15 23:36:16,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:16,714 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 291 transitions. [2019-11-15 23:36:16,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:36:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 291 transitions. [2019-11-15 23:36:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-15 23:36:16,719 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:16,719 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:16,720 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:16,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:16,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1734300147, now seen corresponding path program 1 times [2019-11-15 23:36:16,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:16,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398536435] [2019-11-15 23:36:16,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:16,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:16,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:19,254 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 23:36:19,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398536435] [2019-11-15 23:36:19,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:19,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2019-11-15 23:36:19,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049141343] [2019-11-15 23:36:19,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-11-15 23:36:19,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:19,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-11-15 23:36:19,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-11-15 23:36:19,259 INFO L87 Difference]: Start difference. First operand 288 states and 291 transitions. Second operand 64 states. [2019-11-15 23:36:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:20,639 INFO L93 Difference]: Finished difference Result 291 states and 294 transitions. [2019-11-15 23:36:20,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-11-15 23:36:20,639 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 248 [2019-11-15 23:36:20,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:20,641 INFO L225 Difference]: With dead ends: 291 [2019-11-15 23:36:20,642 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 23:36:20,643 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2019-11-15 23:36:20,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 23:36:20,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-11-15 23:36:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-15 23:36:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 289 transitions. [2019-11-15 23:36:20,651 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 289 transitions. Word has length 248 [2019-11-15 23:36:20,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:20,651 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 289 transitions. [2019-11-15 23:36:20,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-11-15 23:36:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 289 transitions. [2019-11-15 23:36:20,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-11-15 23:36:20,655 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:20,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:20,656 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:20,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:20,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2071264176, now seen corresponding path program 1 times [2019-11-15 23:36:20,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:20,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427901551] [2019-11-15 23:36:20,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:20,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:20,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:21,624 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 23:36:21,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427901551] [2019-11-15 23:36:21,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:21,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:36:21,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805946954] [2019-11-15 23:36:21,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:36:21,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:21,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:36:21,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:36:21,626 INFO L87 Difference]: Start difference. First operand 286 states and 289 transitions. Second operand 5 states. [2019-11-15 23:36:22,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:22,013 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-11-15 23:36:22,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:36:22,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2019-11-15 23:36:22,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:22,016 INFO L225 Difference]: With dead ends: 286 [2019-11-15 23:36:22,016 INFO L226 Difference]: Without dead ends: 284 [2019-11-15 23:36:22,016 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 63 SyntacticMatches, 119 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:36:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-15 23:36:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2019-11-15 23:36:22,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-15 23:36:22,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 287 transitions. [2019-11-15 23:36:22,022 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 287 transitions. Word has length 249 [2019-11-15 23:36:22,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:22,023 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 287 transitions. [2019-11-15 23:36:22,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:36:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 287 transitions. [2019-11-15 23:36:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-11-15 23:36:22,026 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:22,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:22,027 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:22,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:22,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1914822156, now seen corresponding path program 1 times [2019-11-15 23:36:22,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:22,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405356384] [2019-11-15 23:36:22,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:22,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:22,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:24,337 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 23:36:24,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405356384] [2019-11-15 23:36:24,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:24,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-11-15 23:36:24,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115579614] [2019-11-15 23:36:24,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-15 23:36:24,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:24,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-15 23:36:24,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2019-11-15 23:36:24,340 INFO L87 Difference]: Start difference. First operand 284 states and 287 transitions. Second operand 65 states. [2019-11-15 23:36:25,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:25,595 INFO L93 Difference]: Finished difference Result 294 states and 298 transitions. [2019-11-15 23:36:25,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-11-15 23:36:25,596 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 251 [2019-11-15 23:36:25,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:25,598 INFO L225 Difference]: With dead ends: 294 [2019-11-15 23:36:25,598 INFO L226 Difference]: Without dead ends: 292 [2019-11-15 23:36:25,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2019-11-15 23:36:25,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-15 23:36:25,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 282. [2019-11-15 23:36:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-15 23:36:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 285 transitions. [2019-11-15 23:36:25,607 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 285 transitions. Word has length 251 [2019-11-15 23:36:25,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:25,607 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 285 transitions. [2019-11-15 23:36:25,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-15 23:36:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 285 transitions. [2019-11-15 23:36:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-15 23:36:25,611 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:25,611 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:25,612 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:25,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:25,612 INFO L82 PathProgramCache]: Analyzing trace with hash 770061441, now seen corresponding path program 1 times [2019-11-15 23:36:25,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:25,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444091683] [2019-11-15 23:36:25,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:25,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:25,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:25,788 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 23:36:25,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444091683] [2019-11-15 23:36:25,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:25,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:36:25,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816967317] [2019-11-15 23:36:25,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:36:25,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:25,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:36:25,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:36:25,791 INFO L87 Difference]: Start difference. First operand 282 states and 285 transitions. Second operand 4 states. [2019-11-15 23:36:26,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:26,133 INFO L93 Difference]: Finished difference Result 282 states and 285 transitions. [2019-11-15 23:36:26,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:36:26,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-15 23:36:26,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:26,137 INFO L225 Difference]: With dead ends: 282 [2019-11-15 23:36:26,137 INFO L226 Difference]: Without dead ends: 278 [2019-11-15 23:36:26,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:36:26,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-15 23:36:26,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-11-15 23:36:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-11-15 23:36:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2019-11-15 23:36:26,147 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 252 [2019-11-15 23:36:26,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:26,147 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2019-11-15 23:36:26,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:36:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2019-11-15 23:36:26,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-11-15 23:36:26,150 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:26,150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:26,151 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:26,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:26,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1881027289, now seen corresponding path program 1 times [2019-11-15 23:36:26,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:26,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853701268] [2019-11-15 23:36:26,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:26,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:26,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:28,599 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 23:36:28,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853701268] [2019-11-15 23:36:28,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:28,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-11-15 23:36:28,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177628348] [2019-11-15 23:36:28,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-15 23:36:28,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:28,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-15 23:36:28,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2019-11-15 23:36:28,603 INFO L87 Difference]: Start difference. First operand 278 states and 281 transitions. Second operand 65 states. [2019-11-15 23:36:29,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:29,446 INFO L93 Difference]: Finished difference Result 281 states and 284 transitions. [2019-11-15 23:36:29,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-11-15 23:36:29,447 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 253 [2019-11-15 23:36:29,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:29,449 INFO L225 Difference]: With dead ends: 281 [2019-11-15 23:36:29,449 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 23:36:29,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2019-11-15 23:36:29,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 23:36:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-11-15 23:36:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-15 23:36:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 279 transitions. [2019-11-15 23:36:29,458 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 279 transitions. Word has length 253 [2019-11-15 23:36:29,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:29,458 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 279 transitions. [2019-11-15 23:36:29,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-15 23:36:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 279 transitions. [2019-11-15 23:36:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-11-15 23:36:29,460 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:29,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:29,461 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:29,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:29,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1882751193, now seen corresponding path program 1 times [2019-11-15 23:36:29,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:29,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750980272] [2019-11-15 23:36:29,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:29,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:29,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:31,764 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 23:36:31,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750980272] [2019-11-15 23:36:31,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:31,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-11-15 23:36:31,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280277084] [2019-11-15 23:36:31,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-15 23:36:31,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:31,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-15 23:36:31,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2019-11-15 23:36:31,769 INFO L87 Difference]: Start difference. First operand 276 states and 279 transitions. Second operand 65 states. [2019-11-15 23:36:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:32,665 INFO L93 Difference]: Finished difference Result 301 states and 307 transitions. [2019-11-15 23:36:32,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-11-15 23:36:32,665 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 253 [2019-11-15 23:36:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:32,668 INFO L225 Difference]: With dead ends: 301 [2019-11-15 23:36:32,668 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 23:36:32,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2019-11-15 23:36:32,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 23:36:32,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 274. [2019-11-15 23:36:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-11-15 23:36:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 277 transitions. [2019-11-15 23:36:32,677 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 277 transitions. Word has length 253 [2019-11-15 23:36:32,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:32,678 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 277 transitions. [2019-11-15 23:36:32,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-15 23:36:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 277 transitions. [2019-11-15 23:36:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-11-15 23:36:32,680 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:32,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:32,681 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:32,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:32,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1817702396, now seen corresponding path program 1 times [2019-11-15 23:36:32,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:32,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117888718] [2019-11-15 23:36:32,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:32,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:32,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:33,492 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 23:36:33,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117888718] [2019-11-15 23:36:33,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:33,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:36:33,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636591096] [2019-11-15 23:36:33,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:36:33,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:33,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:36:33,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:36:33,494 INFO L87 Difference]: Start difference. First operand 274 states and 277 transitions. Second operand 5 states. [2019-11-15 23:36:33,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:33,980 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-11-15 23:36:33,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:36:33,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 254 [2019-11-15 23:36:33,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:33,982 INFO L225 Difference]: With dead ends: 274 [2019-11-15 23:36:33,982 INFO L226 Difference]: Without dead ends: 270 [2019-11-15 23:36:33,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 64 SyntacticMatches, 121 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:36:33,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-15 23:36:33,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2019-11-15 23:36:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-15 23:36:33,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 273 transitions. [2019-11-15 23:36:33,989 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 273 transitions. Word has length 254 [2019-11-15 23:36:33,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:33,989 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 273 transitions. [2019-11-15 23:36:33,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:36:33,989 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 273 transitions. [2019-11-15 23:36:33,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-11-15 23:36:33,991 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:33,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:33,991 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:33,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:33,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1818153234, now seen corresponding path program 1 times [2019-11-15 23:36:33,992 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:33,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584835180] [2019-11-15 23:36:33,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:33,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:33,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:35,926 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 23:36:35,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584835180] [2019-11-15 23:36:35,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:35,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-11-15 23:36:35,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477449957] [2019-11-15 23:36:35,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-15 23:36:35,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:35,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-15 23:36:35,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2019-11-15 23:36:35,930 INFO L87 Difference]: Start difference. First operand 270 states and 273 transitions. Second operand 65 states. [2019-11-15 23:36:37,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:37,005 INFO L93 Difference]: Finished difference Result 289 states and 294 transitions. [2019-11-15 23:36:37,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-11-15 23:36:37,005 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 254 [2019-11-15 23:36:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:37,007 INFO L225 Difference]: With dead ends: 289 [2019-11-15 23:36:37,007 INFO L226 Difference]: Without dead ends: 287 [2019-11-15 23:36:37,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2019-11-15 23:36:37,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-15 23:36:37,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 268. [2019-11-15 23:36:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-15 23:36:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2019-11-15 23:36:37,015 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 254 [2019-11-15 23:36:37,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:37,016 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2019-11-15 23:36:37,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-15 23:36:37,016 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2019-11-15 23:36:37,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-11-15 23:36:37,017 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:37,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:37,018 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:37,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:37,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1764261316, now seen corresponding path program 1 times [2019-11-15 23:36:37,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:37,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054392008] [2019-11-15 23:36:37,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:37,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:37,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:37,850 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 23:36:37,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054392008] [2019-11-15 23:36:37,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:37,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:36:37,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573614164] [2019-11-15 23:36:37,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:36:37,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:37,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:36:37,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:36:37,852 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand 5 states. [2019-11-15 23:36:38,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:38,289 INFO L93 Difference]: Finished difference Result 278 states and 283 transitions. [2019-11-15 23:36:38,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:36:38,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 254 [2019-11-15 23:36:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:38,292 INFO L225 Difference]: With dead ends: 278 [2019-11-15 23:36:38,292 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 23:36:38,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 64 SyntacticMatches, 121 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:36:38,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 23:36:38,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 266. [2019-11-15 23:36:38,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 23:36:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 269 transitions. [2019-11-15 23:36:38,301 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 269 transitions. Word has length 254 [2019-11-15 23:36:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:38,302 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 269 transitions. [2019-11-15 23:36:38,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:36:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 269 transitions. [2019-11-15 23:36:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-15 23:36:38,303 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:38,304 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:38,304 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:38,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:38,305 INFO L82 PathProgramCache]: Analyzing trace with hash 528181598, now seen corresponding path program 1 times [2019-11-15 23:36:38,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:38,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174371673] [2019-11-15 23:36:38,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:38,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:38,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:39,329 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 23:36:39,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174371673] [2019-11-15 23:36:39,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:39,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:36:39,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801036448] [2019-11-15 23:36:39,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:36:39,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:39,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:36:39,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:36:39,331 INFO L87 Difference]: Start difference. First operand 266 states and 269 transitions. Second operand 5 states. [2019-11-15 23:36:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:39,940 INFO L93 Difference]: Finished difference Result 281 states and 286 transitions. [2019-11-15 23:36:39,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:36:39,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 255 [2019-11-15 23:36:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:39,942 INFO L225 Difference]: With dead ends: 281 [2019-11-15 23:36:39,942 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 23:36:39,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 64 SyntacticMatches, 121 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:36:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 23:36:39,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 264. [2019-11-15 23:36:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-15 23:36:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 267 transitions. [2019-11-15 23:36:39,948 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 267 transitions. Word has length 255 [2019-11-15 23:36:39,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:39,949 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 267 transitions. [2019-11-15 23:36:39,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:36:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 267 transitions. [2019-11-15 23:36:39,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-11-15 23:36:39,951 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:39,951 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:39,951 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:39,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:39,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1056764025, now seen corresponding path program 1 times [2019-11-15 23:36:39,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:39,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323807638] [2019-11-15 23:36:39,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:39,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:39,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:42,195 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 23:36:42,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323807638] [2019-11-15 23:36:42,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:42,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-11-15 23:36:42,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500709753] [2019-11-15 23:36:42,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-11-15 23:36:42,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:42,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-11-15 23:36:42,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-11-15 23:36:42,199 INFO L87 Difference]: Start difference. First operand 264 states and 267 transitions. Second operand 66 states. [2019-11-15 23:36:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:43,404 INFO L93 Difference]: Finished difference Result 290 states and 297 transitions. [2019-11-15 23:36:43,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-11-15 23:36:43,405 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 256 [2019-11-15 23:36:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:43,407 INFO L225 Difference]: With dead ends: 290 [2019-11-15 23:36:43,407 INFO L226 Difference]: Without dead ends: 288 [2019-11-15 23:36:43,409 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2019-11-15 23:36:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-15 23:36:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 262. [2019-11-15 23:36:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-15 23:36:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 265 transitions. [2019-11-15 23:36:43,418 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 265 transitions. Word has length 256 [2019-11-15 23:36:43,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:43,419 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 265 transitions. [2019-11-15 23:36:43,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-11-15 23:36:43,419 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 265 transitions. [2019-11-15 23:36:43,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-15 23:36:43,420 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:43,421 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:43,426 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:43,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:43,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1600059765, now seen corresponding path program 1 times [2019-11-15 23:36:43,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:43,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286691094] [2019-11-15 23:36:43,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:43,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:43,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:43,584 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 23:36:43,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286691094] [2019-11-15 23:36:43,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:43,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:36:43,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148831961] [2019-11-15 23:36:43,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:36:43,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:43,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:36:43,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:36:43,592 INFO L87 Difference]: Start difference. First operand 262 states and 265 transitions. Second operand 4 states. [2019-11-15 23:36:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:43,953 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-11-15 23:36:43,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:36:43,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2019-11-15 23:36:43,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:43,954 INFO L225 Difference]: With dead ends: 262 [2019-11-15 23:36:43,954 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:36:43,955 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:36:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:36:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:36:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:36:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:36:43,956 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 257 [2019-11-15 23:36:43,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:43,957 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:36:43,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:36:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:36:43,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:36:43,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:36:44,200 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 6 [2019-11-15 23:36:44,281 INFO L443 ceAbstractionStarter]: For program point L4065(lines 4065 4983) no Hoare annotation was computed. [2019-11-15 23:36:44,281 INFO L443 ceAbstractionStarter]: For program point L3801(lines 3801 5006) no Hoare annotation was computed. [2019-11-15 23:36:44,282 INFO L443 ceAbstractionStarter]: For program point L3537(lines 3537 5029) no Hoare annotation was computed. [2019-11-15 23:36:44,282 INFO L443 ceAbstractionStarter]: For program point L4462(lines 4462 4949) no Hoare annotation was computed. [2019-11-15 23:36:44,282 INFO L443 ceAbstractionStarter]: For program point L4859(lines 4859 4869) no Hoare annotation was computed. [2019-11-15 23:36:44,282 INFO L443 ceAbstractionStarter]: For program point L1028(lines 1028 1052) no Hoare annotation was computed. [2019-11-15 23:36:44,282 INFO L443 ceAbstractionStarter]: For program point L1821(lines 1821 5181) no Hoare annotation was computed. [2019-11-15 23:36:44,282 INFO L443 ceAbstractionStarter]: For program point L1557(lines 1557 5204) no Hoare annotation was computed. [2019-11-15 23:36:44,282 INFO L443 ceAbstractionStarter]: For program point L1293(lines 1293 5227) no Hoare annotation was computed. [2019-11-15 23:36:44,282 INFO L443 ceAbstractionStarter]: For program point L2218(lines 2218 5147) no Hoare annotation was computed. [2019-11-15 23:36:44,282 INFO L443 ceAbstractionStarter]: For program point L3011(lines 3011 3022) no Hoare annotation was computed. [2019-11-15 23:36:44,282 INFO L443 ceAbstractionStarter]: For program point L4861(line 4861) no Hoare annotation was computed. [2019-11-15 23:36:44,283 INFO L439 ceAbstractionStarter]: At program point L501(lines 355 549) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-11-15 23:36:44,283 INFO L443 ceAbstractionStarter]: For program point L3408(lines 3408 3432) no Hoare annotation was computed. [2019-11-15 23:36:44,283 INFO L443 ceAbstractionStarter]: For program point L4201(lines 4201 4971) no Hoare annotation was computed. [2019-11-15 23:36:44,283 INFO L443 ceAbstractionStarter]: For program point L3937(lines 3937 4994) no Hoare annotation was computed. [2019-11-15 23:36:44,283 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4685) no Hoare annotation was computed. [2019-11-15 23:36:44,283 INFO L443 ceAbstractionStarter]: For program point L3673(lines 3673 5017) no Hoare annotation was computed. [2019-11-15 23:36:44,284 INFO L443 ceAbstractionStarter]: For program point L4598(lines 4598 4937) no Hoare annotation was computed. [2019-11-15 23:36:44,284 INFO L443 ceAbstractionStarter]: For program point L767(lines 767 778) no Hoare annotation was computed. [2019-11-15 23:36:44,284 INFO L443 ceAbstractionStarter]: For program point L1164(lines 1164 1188) no Hoare annotation was computed. [2019-11-15 23:36:44,284 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 4888) no Hoare annotation was computed. [2019-11-15 23:36:44,284 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 114) no Hoare annotation was computed. [2019-11-15 23:36:44,284 INFO L443 ceAbstractionStarter]: For program point L1957(lines 1957 5169) no Hoare annotation was computed. [2019-11-15 23:36:44,284 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 5192) no Hoare annotation was computed. [2019-11-15 23:36:44,284 INFO L443 ceAbstractionStarter]: For program point L1429(lines 1429 5215) no Hoare annotation was computed. [2019-11-15 23:36:44,284 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 392) no Hoare annotation was computed. [2019-11-15 23:36:44,284 INFO L443 ceAbstractionStarter]: For program point L2354(lines 2354 5135) no Hoare annotation was computed. [2019-11-15 23:36:44,285 INFO L443 ceAbstractionStarter]: For program point L3147(lines 3147 3158) no Hoare annotation was computed. [2019-11-15 23:36:44,285 INFO L443 ceAbstractionStarter]: For program point L3544(lines 3544 3568) no Hoare annotation was computed. [2019-11-15 23:36:44,285 INFO L443 ceAbstractionStarter]: For program point L4337(lines 4337 4959) no Hoare annotation was computed. [2019-11-15 23:36:44,285 INFO L443 ceAbstractionStarter]: For program point L4073(lines 4073 4982) no Hoare annotation was computed. [2019-11-15 23:36:44,285 INFO L443 ceAbstractionStarter]: For program point L3809(lines 3809 5005) no Hoare annotation was computed. [2019-11-15 23:36:44,285 INFO L439 ceAbstractionStarter]: At program point L638(lines 123 640) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-11-15 23:36:44,285 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 4750) no Hoare annotation was computed. [2019-11-15 23:36:44,285 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 914) no Hoare annotation was computed. [2019-11-15 23:36:44,285 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1324) no Hoare annotation was computed. [2019-11-15 23:36:44,286 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 250) no Hoare annotation was computed. [2019-11-15 23:36:44,286 INFO L443 ceAbstractionStarter]: For program point L2093(lines 2093 5157) no Hoare annotation was computed. [2019-11-15 23:36:44,286 INFO L443 ceAbstractionStarter]: For program point L1829(lines 1829 5180) no Hoare annotation was computed. [2019-11-15 23:36:44,286 INFO L439 ceAbstractionStarter]: At program point L4868(lines 4725 4917) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~271 0)) (<= 61 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~273 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~270 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~272 0))) [2019-11-15 23:36:44,286 INFO L443 ceAbstractionStarter]: For program point L4736(lines 4736 4758) no Hoare annotation was computed. [2019-11-15 23:36:44,286 INFO L443 ceAbstractionStarter]: For program point L1565(lines 1565 5203) no Hoare annotation was computed. [2019-11-15 23:36:44,286 INFO L443 ceAbstractionStarter]: For program point L2490(lines 2490 5123) no Hoare annotation was computed. [2019-11-15 23:36:44,286 INFO L443 ceAbstractionStarter]: For program point L3283(lines 3283 3294) no Hoare annotation was computed. [2019-11-15 23:36:44,286 INFO L443 ceAbstractionStarter]: For program point L3680(lines 3680 3704) no Hoare annotation was computed. [2019-11-15 23:36:44,287 INFO L443 ceAbstractionStarter]: For program point L4473(lines 4473 4947) no Hoare annotation was computed. [2019-11-15 23:36:44,287 INFO L443 ceAbstractionStarter]: For program point L4209(lines 4209 4970) no Hoare annotation was computed. [2019-11-15 23:36:44,287 INFO L443 ceAbstractionStarter]: For program point L3945(lines 3945 4993) no Hoare annotation was computed. [2019-11-15 23:36:44,287 INFO L443 ceAbstractionStarter]: For program point L4738(line 4738) no Hoare annotation was computed. [2019-11-15 23:36:44,287 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1050) no Hoare annotation was computed. [2019-11-15 23:36:44,287 INFO L443 ceAbstractionStarter]: For program point L1436(lines 1436 1460) no Hoare annotation was computed. [2019-11-15 23:36:44,287 INFO L443 ceAbstractionStarter]: For program point L2229(lines 2229 5145) no Hoare annotation was computed. [2019-11-15 23:36:44,287 INFO L443 ceAbstractionStarter]: For program point L1965(lines 1965 5168) no Hoare annotation was computed. [2019-11-15 23:36:44,287 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 5191) no Hoare annotation was computed. [2019-11-15 23:36:44,287 INFO L443 ceAbstractionStarter]: For program point L2626(lines 2626 5111) no Hoare annotation was computed. [2019-11-15 23:36:44,288 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 546) no Hoare annotation was computed. [2019-11-15 23:36:44,288 INFO L443 ceAbstractionStarter]: For program point L3419(lines 3419 3430) no Hoare annotation was computed. [2019-11-15 23:36:44,288 INFO L443 ceAbstractionStarter]: For program point L3816(lines 3816 3840) no Hoare annotation was computed. [2019-11-15 23:36:44,288 INFO L443 ceAbstractionStarter]: For program point L4609(lines 4609 4935) no Hoare annotation was computed. [2019-11-15 23:36:44,288 INFO L443 ceAbstractionStarter]: For program point L4345(lines 4345 4958) no Hoare annotation was computed. [2019-11-15 23:36:44,288 INFO L443 ceAbstractionStarter]: For program point L4081(lines 4081 4981) no Hoare annotation was computed. [2019-11-15 23:36:44,288 INFO L443 ceAbstractionStarter]: For program point L1175(lines 1175 1186) no Hoare annotation was computed. [2019-11-15 23:36:44,288 INFO L443 ceAbstractionStarter]: For program point L1572(lines 1572 1596) no Hoare annotation was computed. [2019-11-15 23:36:44,288 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 390) no Hoare annotation was computed. [2019-11-15 23:36:44,288 INFO L443 ceAbstractionStarter]: For program point L2365(lines 2365 5133) no Hoare annotation was computed. [2019-11-15 23:36:44,289 INFO L443 ceAbstractionStarter]: For program point L2101(lines 2101 5156) no Hoare annotation was computed. [2019-11-15 23:36:44,289 INFO L443 ceAbstractionStarter]: For program point L1837(lines 1837 5179) no Hoare annotation was computed. [2019-11-15 23:36:44,289 INFO L443 ceAbstractionStarter]: For program point L2762(lines 2762 5099) no Hoare annotation was computed. [2019-11-15 23:36:44,289 INFO L443 ceAbstractionStarter]: For program point L3555(lines 3555 3566) no Hoare annotation was computed. [2019-11-15 23:36:44,289 INFO L443 ceAbstractionStarter]: For program point L3952(lines 3952 3976) no Hoare annotation was computed. [2019-11-15 23:36:44,289 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2019-11-15 23:36:44,291 INFO L443 ceAbstractionStarter]: For program point L4481(lines 4481 4946) no Hoare annotation was computed. [2019-11-15 23:36:44,291 INFO L443 ceAbstractionStarter]: For program point L4217(lines 4217 4969) no Hoare annotation was computed. [2019-11-15 23:36:44,291 INFO L443 ceAbstractionStarter]: For program point L1311(lines 1311 1322) no Hoare annotation was computed. [2019-11-15 23:36:44,291 INFO L443 ceAbstractionStarter]: For program point L4879(lines 4879 4914) no Hoare annotation was computed. [2019-11-15 23:36:44,291 INFO L443 ceAbstractionStarter]: For program point L1708(lines 1708 1732) no Hoare annotation was computed. [2019-11-15 23:36:44,292 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 539) no Hoare annotation was computed. [2019-11-15 23:36:44,292 INFO L443 ceAbstractionStarter]: For program point L2501(lines 2501 5121) no Hoare annotation was computed. [2019-11-15 23:36:44,292 INFO L443 ceAbstractionStarter]: For program point L2237(lines 2237 5144) no Hoare annotation was computed. [2019-11-15 23:36:44,292 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 640) no Hoare annotation was computed. [2019-11-15 23:36:44,292 INFO L443 ceAbstractionStarter]: For program point L1973(lines 1973 5167) no Hoare annotation was computed. [2019-11-15 23:36:44,292 INFO L443 ceAbstractionStarter]: For program point L2898(lines 2898 5087) no Hoare annotation was computed. [2019-11-15 23:36:44,292 INFO L443 ceAbstractionStarter]: For program point L3691(lines 3691 3702) no Hoare annotation was computed. [2019-11-15 23:36:44,293 INFO L443 ceAbstractionStarter]: For program point L4748(lines 4748 4756) no Hoare annotation was computed. [2019-11-15 23:36:44,293 INFO L443 ceAbstractionStarter]: For program point L4088(lines 4088 4112) no Hoare annotation was computed. [2019-11-15 23:36:44,293 INFO L443 ceAbstractionStarter]: For program point L4617(lines 4617 4934) no Hoare annotation was computed. [2019-11-15 23:36:44,293 INFO L443 ceAbstractionStarter]: For program point L4353(lines 4353 4957) no Hoare annotation was computed. [2019-11-15 23:36:44,293 INFO L443 ceAbstractionStarter]: For program point L4750(line 4750) no Hoare annotation was computed. [2019-11-15 23:36:44,293 INFO L443 ceAbstractionStarter]: For program point L654(lines 654 5285) no Hoare annotation was computed. [2019-11-15 23:36:44,294 INFO L443 ceAbstractionStarter]: For program point L1447(lines 1447 1458) no Hoare annotation was computed. [2019-11-15 23:36:44,294 INFO L443 ceAbstractionStarter]: For program point L1844(lines 1844 1868) no Hoare annotation was computed. [2019-11-15 23:36:44,294 INFO L443 ceAbstractionStarter]: For program point L2637(lines 2637 5109) no Hoare annotation was computed. [2019-11-15 23:36:44,294 INFO L443 ceAbstractionStarter]: For program point L2373(lines 2373 5132) no Hoare annotation was computed. [2019-11-15 23:36:44,294 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 594) no Hoare annotation was computed. [2019-11-15 23:36:44,294 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 600) no Hoare annotation was computed. [2019-11-15 23:36:44,295 INFO L443 ceAbstractionStarter]: For program point L2109(lines 2109 5155) no Hoare annotation was computed. [2019-11-15 23:36:44,295 INFO L443 ceAbstractionStarter]: For program point L3034(lines 3034 5075) no Hoare annotation was computed. [2019-11-15 23:36:44,295 INFO L443 ceAbstractionStarter]: For program point L3827(lines 3827 3838) no Hoare annotation was computed. [2019-11-15 23:36:44,295 INFO L443 ceAbstractionStarter]: For program point L4224(lines 4224 4248) no Hoare annotation was computed. [2019-11-15 23:36:44,295 INFO L443 ceAbstractionStarter]: For program point L4489(lines 4489 4945) no Hoare annotation was computed. [2019-11-15 23:36:44,295 INFO L443 ceAbstractionStarter]: For program point L4886(lines 4886 4908) no Hoare annotation was computed. [2019-11-15 23:36:44,295 INFO L443 ceAbstractionStarter]: For program point L790(lines 790 5273) no Hoare annotation was computed. [2019-11-15 23:36:44,296 INFO L443 ceAbstractionStarter]: For program point L1583(lines 1583 1594) no Hoare annotation was computed. [2019-11-15 23:36:44,296 INFO L443 ceAbstractionStarter]: For program point L1980(lines 1980 2004) no Hoare annotation was computed. [2019-11-15 23:36:44,296 INFO L443 ceAbstractionStarter]: For program point L2773(lines 2773 5097) no Hoare annotation was computed. [2019-11-15 23:36:44,296 INFO L443 ceAbstractionStarter]: For program point L2509(lines 2509 5120) no Hoare annotation was computed. [2019-11-15 23:36:44,296 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 4818) no Hoare annotation was computed. [2019-11-15 23:36:44,296 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 553) no Hoare annotation was computed. [2019-11-15 23:36:44,296 INFO L443 ceAbstractionStarter]: For program point L2245(lines 2245 5143) no Hoare annotation was computed. [2019-11-15 23:36:44,297 INFO L443 ceAbstractionStarter]: For program point L3170(lines 3170 5063) no Hoare annotation was computed. [2019-11-15 23:36:44,297 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:36:44,297 INFO L443 ceAbstractionStarter]: For program point L3963(lines 3963 3974) no Hoare annotation was computed. [2019-11-15 23:36:44,297 INFO L443 ceAbstractionStarter]: For program point L4888(line 4888) no Hoare annotation was computed. [2019-11-15 23:36:44,297 INFO L443 ceAbstractionStarter]: For program point L4360(lines 4360 4384) no Hoare annotation was computed. [2019-11-15 23:36:44,297 INFO L443 ceAbstractionStarter]: For program point L4625(lines 4625 4933) no Hoare annotation was computed. [2019-11-15 23:36:44,298 INFO L443 ceAbstractionStarter]: For program point L926(lines 926 5261) no Hoare annotation was computed. [2019-11-15 23:36:44,298 INFO L443 ceAbstractionStarter]: For program point L1719(lines 1719 1730) no Hoare annotation was computed. [2019-11-15 23:36:44,298 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 537) no Hoare annotation was computed. [2019-11-15 23:36:44,298 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 189) no Hoare annotation was computed. [2019-11-15 23:36:44,298 INFO L443 ceAbstractionStarter]: For program point L2116(lines 2116 2140) no Hoare annotation was computed. [2019-11-15 23:36:44,298 INFO L443 ceAbstractionStarter]: For program point L2909(lines 2909 5085) no Hoare annotation was computed. [2019-11-15 23:36:44,299 INFO L443 ceAbstractionStarter]: For program point L2645(lines 2645 5108) no Hoare annotation was computed. [2019-11-15 23:36:44,299 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 547) no Hoare annotation was computed. [2019-11-15 23:36:44,299 INFO L443 ceAbstractionStarter]: For program point L2381(lines 2381 5131) no Hoare annotation was computed. [2019-11-15 23:36:44,299 INFO L443 ceAbstractionStarter]: For program point L3306(lines 3306 5051) no Hoare annotation was computed. [2019-11-15 23:36:44,299 INFO L443 ceAbstractionStarter]: For program point L4099(lines 4099 4110) no Hoare annotation was computed. [2019-11-15 23:36:44,300 INFO L443 ceAbstractionStarter]: For program point L4496(lines 4496 4520) no Hoare annotation was computed. [2019-11-15 23:36:44,300 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 5283) no Hoare annotation was computed. [2019-11-15 23:36:44,300 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 5249) no Hoare annotation was computed. [2019-11-15 23:36:44,301 INFO L443 ceAbstractionStarter]: For program point L1855(lines 1855 1866) no Hoare annotation was computed. [2019-11-15 23:36:44,301 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 325) no Hoare annotation was computed. [2019-11-15 23:36:44,301 INFO L443 ceAbstractionStarter]: For program point L2252(lines 2252 2276) no Hoare annotation was computed. [2019-11-15 23:36:44,301 INFO L443 ceAbstractionStarter]: For program point L3045(lines 3045 5073) no Hoare annotation was computed. [2019-11-15 23:36:44,301 INFO L443 ceAbstractionStarter]: For program point L2781(lines 2781 5096) no Hoare annotation was computed. [2019-11-15 23:36:44,301 INFO L443 ceAbstractionStarter]: For program point L2517(lines 2517 5119) no Hoare annotation was computed. [2019-11-15 23:36:44,302 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 506) no Hoare annotation was computed. [2019-11-15 23:36:44,302 INFO L443 ceAbstractionStarter]: For program point L3442(lines 3442 5039) no Hoare annotation was computed. [2019-11-15 23:36:44,302 INFO L443 ceAbstractionStarter]: For program point L4235(lines 4235 4246) no Hoare annotation was computed. [2019-11-15 23:36:44,302 INFO L446 ceAbstractionStarter]: At program point L5292(lines 22 5295) the Hoare annotation is: true [2019-11-15 23:36:44,302 INFO L443 ceAbstractionStarter]: For program point L4632(lines 4632 4656) no Hoare annotation was computed. [2019-11-15 23:36:44,302 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 5271) no Hoare annotation was computed. [2019-11-15 23:36:44,303 INFO L443 ceAbstractionStarter]: For program point L4765(lines 4765 4915) no Hoare annotation was computed. [2019-11-15 23:36:44,303 INFO L446 ceAbstractionStarter]: At program point L5294(lines 17 5296) the Hoare annotation is: true [2019-11-15 23:36:44,303 INFO L443 ceAbstractionStarter]: For program point L1198(lines 1198 5237) no Hoare annotation was computed. [2019-11-15 23:36:44,303 INFO L443 ceAbstractionStarter]: For program point L1991(lines 1991 2002) no Hoare annotation was computed. [2019-11-15 23:36:44,303 INFO L443 ceAbstractionStarter]: For program point L4898(lines 4898 4906) no Hoare annotation was computed. [2019-11-15 23:36:44,303 INFO L443 ceAbstractionStarter]: For program point L2388(lines 2388 2412) no Hoare annotation was computed. [2019-11-15 23:36:44,303 INFO L443 ceAbstractionStarter]: For program point L3181(lines 3181 5061) no Hoare annotation was computed. [2019-11-15 23:36:44,304 INFO L443 ceAbstractionStarter]: For program point L2917(lines 2917 5084) no Hoare annotation was computed. [2019-11-15 23:36:44,304 INFO L443 ceAbstractionStarter]: For program point L2653(lines 2653 5107) no Hoare annotation was computed. [2019-11-15 23:36:44,304 INFO L443 ceAbstractionStarter]: For program point L3578(lines 3578 5027) no Hoare annotation was computed. [2019-11-15 23:36:44,304 INFO L443 ceAbstractionStarter]: For program point L4371(lines 4371 4382) no Hoare annotation was computed. [2019-11-15 23:36:44,304 INFO L443 ceAbstractionStarter]: For program point L4900(line 4900) no Hoare annotation was computed. [2019-11-15 23:36:44,304 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 5259) no Hoare annotation was computed. [2019-11-15 23:36:44,305 INFO L443 ceAbstractionStarter]: For program point L673(lines 673 5282) no Hoare annotation was computed. [2019-11-15 23:36:44,305 INFO L443 ceAbstractionStarter]: For program point L4769(lines 4769 4873) no Hoare annotation was computed. [2019-11-15 23:36:44,305 INFO L443 ceAbstractionStarter]: For program point L1334(lines 1334 5225) no Hoare annotation was computed. [2019-11-15 23:36:44,305 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 187) no Hoare annotation was computed. [2019-11-15 23:36:44,305 INFO L443 ceAbstractionStarter]: For program point L2127(lines 2127 2138) no Hoare annotation was computed. [2019-11-15 23:36:44,305 INFO L443 ceAbstractionStarter]: For program point L2524(lines 2524 2548) no Hoare annotation was computed. [2019-11-15 23:36:44,306 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 465) no Hoare annotation was computed. [2019-11-15 23:36:44,306 INFO L443 ceAbstractionStarter]: For program point L3317(lines 3317 5049) no Hoare annotation was computed. [2019-11-15 23:36:44,306 INFO L443 ceAbstractionStarter]: For program point L3053(lines 3053 5072) no Hoare annotation was computed. [2019-11-15 23:36:44,306 INFO L443 ceAbstractionStarter]: For program point L2789(lines 2789 5095) no Hoare annotation was computed. [2019-11-15 23:36:44,306 INFO L443 ceAbstractionStarter]: For program point L3714(lines 3714 5015) no Hoare annotation was computed. [2019-11-15 23:36:44,306 INFO L443 ceAbstractionStarter]: For program point L4507(lines 4507 4518) no Hoare annotation was computed. [2019-11-15 23:36:44,306 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 4738) no Hoare annotation was computed. [2019-11-15 23:36:44,307 INFO L443 ceAbstractionStarter]: For program point L1073(lines 1073 5247) no Hoare annotation was computed. [2019-11-15 23:36:44,307 INFO L443 ceAbstractionStarter]: For program point L809(lines 809 5270) no Hoare annotation was computed. [2019-11-15 23:36:44,307 INFO L439 ceAbstractionStarter]: At program point L545(lines 399 547) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-11-15 23:36:44,307 INFO L443 ceAbstractionStarter]: For program point L1470(lines 1470 5213) no Hoare annotation was computed. [2019-11-15 23:36:44,307 INFO L443 ceAbstractionStarter]: For program point L281(lines 281 323) no Hoare annotation was computed. [2019-11-15 23:36:44,307 INFO L443 ceAbstractionStarter]: For program point L2263(lines 2263 2274) no Hoare annotation was computed. [2019-11-15 23:36:44,308 INFO L443 ceAbstractionStarter]: For program point L2660(lines 2660 2684) no Hoare annotation was computed. [2019-11-15 23:36:44,308 INFO L443 ceAbstractionStarter]: For program point L3453(lines 3453 5037) no Hoare annotation was computed. [2019-11-15 23:36:44,308 INFO L443 ceAbstractionStarter]: For program point L3189(lines 3189 5060) no Hoare annotation was computed. [2019-11-15 23:36:44,308 INFO L443 ceAbstractionStarter]: For program point L2925(lines 2925 5083) no Hoare annotation was computed. [2019-11-15 23:36:44,308 INFO L443 ceAbstractionStarter]: For program point L3850(lines 3850 5003) no Hoare annotation was computed. [2019-11-15 23:36:44,308 INFO L443 ceAbstractionStarter]: For program point L4643(lines 4643 4654) no Hoare annotation was computed. [2019-11-15 23:36:44,309 INFO L443 ceAbstractionStarter]: For program point L4776(lines 4776 4835) no Hoare annotation was computed. [2019-11-15 23:36:44,309 INFO L443 ceAbstractionStarter]: For program point L1209(lines 1209 5235) no Hoare annotation was computed. [2019-11-15 23:36:44,309 INFO L443 ceAbstractionStarter]: For program point L945(lines 945 5258) no Hoare annotation was computed. [2019-11-15 23:36:44,309 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 4806) no Hoare annotation was computed. [2019-11-15 23:36:44,309 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 5281) no Hoare annotation was computed. [2019-11-15 23:36:44,309 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 5201) no Hoare annotation was computed. [2019-11-15 23:36:44,310 INFO L443 ceAbstractionStarter]: For program point L2399(lines 2399 2410) no Hoare annotation was computed. [2019-11-15 23:36:44,310 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 186) no Hoare annotation was computed. [2019-11-15 23:36:44,310 INFO L443 ceAbstractionStarter]: For program point L2796(lines 2796 2820) no Hoare annotation was computed. [2019-11-15 23:36:44,310 INFO L443 ceAbstractionStarter]: For program point L4778(line 4778) no Hoare annotation was computed. [2019-11-15 23:36:44,310 INFO L443 ceAbstractionStarter]: For program point L3589(lines 3589 5025) no Hoare annotation was computed. [2019-11-15 23:36:44,310 INFO L443 ceAbstractionStarter]: For program point L3325(lines 3325 5048) no Hoare annotation was computed. [2019-11-15 23:36:44,311 INFO L443 ceAbstractionStarter]: For program point L22(lines 22 5295) no Hoare annotation was computed. [2019-11-15 23:36:44,311 INFO L443 ceAbstractionStarter]: For program point L3061(lines 3061 5071) no Hoare annotation was computed. [2019-11-15 23:36:44,311 INFO L443 ceAbstractionStarter]: For program point L3986(lines 3986 4991) no Hoare annotation was computed. [2019-11-15 23:36:44,311 INFO L443 ceAbstractionStarter]: For program point L1345(lines 1345 5223) no Hoare annotation was computed. [2019-11-15 23:36:44,311 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 5246) no Hoare annotation was computed. [2019-11-15 23:36:44,311 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 5269) no Hoare annotation was computed. [2019-11-15 23:36:44,312 INFO L439 ceAbstractionStarter]: At program point L4913(lines 4765 4915) the Hoare annotation is: (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~271 0)) (<= 61 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~273 0)) (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~270 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~272 0))) [2019-11-15 23:36:44,312 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 5189) no Hoare annotation was computed. [2019-11-15 23:36:44,312 INFO L443 ceAbstractionStarter]: For program point L2535(lines 2535 2546) no Hoare annotation was computed. [2019-11-15 23:36:44,312 INFO L443 ceAbstractionStarter]: For program point L421(lines 421 463) no Hoare annotation was computed. [2019-11-15 23:36:44,312 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 322) no Hoare annotation was computed. [2019-11-15 23:36:44,313 INFO L443 ceAbstractionStarter]: For program point L2932(lines 2932 2956) no Hoare annotation was computed. [2019-11-15 23:36:44,313 INFO L443 ceAbstractionStarter]: For program point L3725(lines 3725 5013) no Hoare annotation was computed. [2019-11-15 23:36:44,313 INFO L443 ceAbstractionStarter]: For program point L3461(lines 3461 5036) no Hoare annotation was computed. [2019-11-15 23:36:44,313 INFO L443 ceAbstractionStarter]: For program point L3197(lines 3197 5059) no Hoare annotation was computed. [2019-11-15 23:36:44,313 INFO L443 ceAbstractionStarter]: For program point L4122(lines 4122 4979) no Hoare annotation was computed. [2019-11-15 23:36:44,313 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 5288) no Hoare annotation was computed. [2019-11-15 23:36:44,313 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 712) no Hoare annotation was computed. [2019-11-15 23:36:44,314 INFO L443 ceAbstractionStarter]: For program point L1481(lines 1481 5211) no Hoare annotation was computed. [2019-11-15 23:36:44,314 INFO L443 ceAbstractionStarter]: For program point L1217(lines 1217 5234) no Hoare annotation was computed. [2019-11-15 23:36:44,314 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 180) no Hoare annotation was computed. [2019-11-15 23:36:44,314 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:36:44,314 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 5257) no Hoare annotation was computed. [2019-11-15 23:36:44,314 INFO L443 ceAbstractionStarter]: For program point L1878(lines 1878 5177) no Hoare annotation was computed. [2019-11-15 23:36:44,315 INFO L443 ceAbstractionStarter]: For program point L2671(lines 2671 2682) no Hoare annotation was computed. [2019-11-15 23:36:44,315 INFO L439 ceAbstractionStarter]: At program point L4653(lines 63 5287) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-11-15 23:36:44,315 INFO L443 ceAbstractionStarter]: For program point L3068(lines 3068 3092) no Hoare annotation was computed. [2019-11-15 23:36:44,315 INFO L443 ceAbstractionStarter]: For program point L3861(lines 3861 5001) no Hoare annotation was computed. [2019-11-15 23:36:44,315 INFO L443 ceAbstractionStarter]: For program point L3597(lines 3597 5024) no Hoare annotation was computed. [2019-11-15 23:36:44,315 INFO L443 ceAbstractionStarter]: For program point L3333(lines 3333 5047) no Hoare annotation was computed. [2019-11-15 23:36:44,316 INFO L443 ceAbstractionStarter]: For program point L4258(lines 4258 4967) no Hoare annotation was computed. [2019-11-15 23:36:44,316 INFO L443 ceAbstractionStarter]: For program point L559(lines 559 593) no Hoare annotation was computed. [2019-11-15 23:36:44,316 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 848) no Hoare annotation was computed. [2019-11-15 23:36:44,316 INFO L443 ceAbstractionStarter]: For program point L4788(lines 4788 4833) no Hoare annotation was computed. [2019-11-15 23:36:44,316 INFO L443 ceAbstractionStarter]: For program point L1617(lines 1617 5199) no Hoare annotation was computed. [2019-11-15 23:36:44,316 INFO L443 ceAbstractionStarter]: For program point L1353(lines 1353 5222) no Hoare annotation was computed. [2019-11-15 23:36:44,317 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 316) no Hoare annotation was computed. [2019-11-15 23:36:44,317 INFO L443 ceAbstractionStarter]: For program point L1089(lines 1089 5245) no Hoare annotation was computed. [2019-11-15 23:36:44,317 INFO L443 ceAbstractionStarter]: For program point L2014(lines 2014 5165) no Hoare annotation was computed. [2019-11-15 23:36:44,317 INFO L443 ceAbstractionStarter]: For program point L2807(lines 2807 2818) no Hoare annotation was computed. [2019-11-15 23:36:44,317 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 462) no Hoare annotation was computed. [2019-11-15 23:36:44,317 INFO L443 ceAbstractionStarter]: For program point L3204(lines 3204 3228) no Hoare annotation was computed. [2019-11-15 23:36:44,318 INFO L443 ceAbstractionStarter]: For program point L3997(lines 3997 4989) no Hoare annotation was computed. [2019-11-15 23:36:44,318 INFO L443 ceAbstractionStarter]: For program point L4790(line 4790) no Hoare annotation was computed. [2019-11-15 23:36:44,318 INFO L443 ceAbstractionStarter]: For program point L3733(lines 3733 5012) no Hoare annotation was computed. [2019-11-15 23:36:44,318 INFO L443 ceAbstractionStarter]: For program point L3469(lines 3469 5035) no Hoare annotation was computed. [2019-11-15 23:36:44,318 INFO L443 ceAbstractionStarter]: For program point L4394(lines 4394 4955) no Hoare annotation was computed. [2019-11-15 23:36:44,318 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 56) no Hoare annotation was computed. [2019-11-15 23:36:44,319 INFO L443 ceAbstractionStarter]: For program point L960(lines 960 984) no Hoare annotation was computed. [2019-11-15 23:36:44,319 INFO L443 ceAbstractionStarter]: For program point L1753(lines 1753 5187) no Hoare annotation was computed. [2019-11-15 23:36:44,320 INFO L443 ceAbstractionStarter]: For program point L1489(lines 1489 5210) no Hoare annotation was computed. [2019-11-15 23:36:44,321 INFO L443 ceAbstractionStarter]: For program point L1225(lines 1225 5233) no Hoare annotation was computed. [2019-11-15 23:36:44,321 INFO L443 ceAbstractionStarter]: For program point L2150(lines 2150 5153) no Hoare annotation was computed. [2019-11-15 23:36:44,321 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-15 23:36:44,321 INFO L443 ceAbstractionStarter]: For program point L2943(lines 2943 2954) no Hoare annotation was computed. [2019-11-15 23:36:44,321 INFO L443 ceAbstractionStarter]: For program point L3340(lines 3340 3364) no Hoare annotation was computed. [2019-11-15 23:36:44,322 INFO L443 ceAbstractionStarter]: For program point L4133(lines 4133 4977) no Hoare annotation was computed. [2019-11-15 23:36:44,322 INFO L439 ceAbstractionStarter]: At program point L4926(lines 4660 4933) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 59 ULTIMATE.start_main_~main__t~0)) [2019-11-15 23:36:44,322 INFO L443 ceAbstractionStarter]: For program point L3869(lines 3869 5000) no Hoare annotation was computed. [2019-11-15 23:36:44,322 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4721) no Hoare annotation was computed. [2019-11-15 23:36:44,322 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 586) no Hoare annotation was computed. [2019-11-15 23:36:44,322 INFO L443 ceAbstractionStarter]: For program point L3605(lines 3605 5023) no Hoare annotation was computed. [2019-11-15 23:36:44,323 INFO L443 ceAbstractionStarter]: For program point L4530(lines 4530 4943) no Hoare annotation was computed. [2019-11-15 23:36:44,327 INFO L443 ceAbstractionStarter]: For program point L699(lines 699 710) no Hoare annotation was computed. [2019-11-15 23:36:44,328 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 178) no Hoare annotation was computed. [2019-11-15 23:36:44,328 INFO L443 ceAbstractionStarter]: For program point L1096(lines 1096 1120) no Hoare annotation was computed. [2019-11-15 23:36:44,328 INFO L443 ceAbstractionStarter]: For program point L1889(lines 1889 5175) no Hoare annotation was computed. [2019-11-15 23:36:44,328 INFO L443 ceAbstractionStarter]: For program point L1625(lines 1625 5198) no Hoare annotation was computed. [2019-11-15 23:36:44,328 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 456) no Hoare annotation was computed. [2019-11-15 23:36:44,328 INFO L443 ceAbstractionStarter]: For program point L1361(lines 1361 5221) no Hoare annotation was computed. [2019-11-15 23:36:44,329 INFO L443 ceAbstractionStarter]: For program point L2286(lines 2286 5141) no Hoare annotation was computed. [2019-11-15 23:36:44,329 INFO L443 ceAbstractionStarter]: For program point L3079(lines 3079 3090) no Hoare annotation was computed. [2019-11-15 23:36:44,329 INFO L443 ceAbstractionStarter]: For program point L4797(lines 4797 4832) no Hoare annotation was computed. [2019-11-15 23:36:44,329 INFO L443 ceAbstractionStarter]: For program point L3476(lines 3476 3500) no Hoare annotation was computed. [2019-11-15 23:36:44,329 INFO L443 ceAbstractionStarter]: For program point L4269(lines 4269 4965) no Hoare annotation was computed. [2019-11-15 23:36:44,329 INFO L443 ceAbstractionStarter]: For program point L4005(lines 4005 4988) no Hoare annotation was computed. [2019-11-15 23:36:44,329 INFO L443 ceAbstractionStarter]: For program point L3741(lines 3741 5011) no Hoare annotation was computed. [2019-11-15 23:36:44,330 INFO L443 ceAbstractionStarter]: For program point L835(lines 835 846) no Hoare annotation was computed. [2019-11-15 23:36:44,330 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 314) no Hoare annotation was computed. [2019-11-15 23:36:44,330 INFO L443 ceAbstractionStarter]: For program point L1232(lines 1232 1256) no Hoare annotation was computed. [2019-11-15 23:36:44,330 INFO L443 ceAbstractionStarter]: For program point L2025(lines 2025 5163) no Hoare annotation was computed. [2019-11-15 23:36:44,330 INFO L443 ceAbstractionStarter]: For program point L1761(lines 1761 5186) no Hoare annotation was computed. [2019-11-15 23:36:44,330 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 5209) no Hoare annotation was computed. [2019-11-15 23:36:44,331 INFO L443 ceAbstractionStarter]: For program point L2422(lines 2422 5129) no Hoare annotation was computed. [2019-11-15 23:36:44,331 INFO L443 ceAbstractionStarter]: For program point L3215(lines 3215 3226) no Hoare annotation was computed. [2019-11-15 23:36:44,331 INFO L443 ceAbstractionStarter]: For program point L3612(lines 3612 3636) no Hoare annotation was computed. [2019-11-15 23:36:44,331 INFO L443 ceAbstractionStarter]: For program point L4405(lines 4405 4953) no Hoare annotation was computed. [2019-11-15 23:36:44,331 INFO L443 ceAbstractionStarter]: For program point L4141(lines 4141 4976) no Hoare annotation was computed. [2019-11-15 23:36:44,331 INFO L443 ceAbstractionStarter]: For program point L3877(lines 3877 4999) no Hoare annotation was computed. [2019-11-15 23:36:44,331 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 54) no Hoare annotation was computed. [2019-11-15 23:36:44,332 INFO L443 ceAbstractionStarter]: For program point L971(lines 971 982) no Hoare annotation was computed. [2019-11-15 23:36:44,332 INFO L443 ceAbstractionStarter]: For program point L4671(lines 4671 4931) no Hoare annotation was computed. [2019-11-15 23:36:44,332 INFO L443 ceAbstractionStarter]: For program point L1368(lines 1368 1392) no Hoare annotation was computed. [2019-11-15 23:36:44,332 INFO L443 ceAbstractionStarter]: For program point L2161(lines 2161 5151) no Hoare annotation was computed. [2019-11-15 23:36:44,332 INFO L443 ceAbstractionStarter]: For program point L1897(lines 1897 5174) no Hoare annotation was computed. [2019-11-15 23:36:44,332 INFO L443 ceAbstractionStarter]: For program point L4804(lines 4804 4826) no Hoare annotation was computed. [2019-11-15 23:36:44,333 INFO L443 ceAbstractionStarter]: For program point L1633(lines 1633 5197) no Hoare annotation was computed. [2019-11-15 23:36:44,333 INFO L443 ceAbstractionStarter]: For program point L2558(lines 2558 5117) no Hoare annotation was computed. [2019-11-15 23:36:44,333 INFO L443 ceAbstractionStarter]: For program point L3351(lines 3351 3362) no Hoare annotation was computed. [2019-11-15 23:36:44,333 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-15 23:36:44,333 INFO L443 ceAbstractionStarter]: For program point L3748(lines 3748 3772) no Hoare annotation was computed. [2019-11-15 23:36:44,333 INFO L443 ceAbstractionStarter]: For program point L577(lines 577 584) no Hoare annotation was computed. [2019-11-15 23:36:44,334 INFO L443 ceAbstractionStarter]: For program point L4673(line 4673) no Hoare annotation was computed. [2019-11-15 23:36:44,334 INFO L443 ceAbstractionStarter]: For program point L4541(lines 4541 4941) no Hoare annotation was computed. [2019-11-15 23:36:44,334 INFO L443 ceAbstractionStarter]: For program point L4277(lines 4277 4964) no Hoare annotation was computed. [2019-11-15 23:36:44,334 INFO L443 ceAbstractionStarter]: For program point L4013(lines 4013 4987) no Hoare annotation was computed. [2019-11-15 23:36:44,334 INFO L443 ceAbstractionStarter]: For program point L4806(line 4806) no Hoare annotation was computed. [2019-11-15 23:36:44,334 INFO L443 ceAbstractionStarter]: For program point L1107(lines 1107 1118) no Hoare annotation was computed. [2019-11-15 23:36:44,335 INFO L443 ceAbstractionStarter]: For program point L1504(lines 1504 1528) no Hoare annotation was computed. [2019-11-15 23:36:44,335 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 454) no Hoare annotation was computed. [2019-11-15 23:36:44,335 INFO L443 ceAbstractionStarter]: For program point L2297(lines 2297 5139) no Hoare annotation was computed. [2019-11-15 23:36:44,335 INFO L443 ceAbstractionStarter]: For program point L2033(lines 2033 5162) no Hoare annotation was computed. [2019-11-15 23:36:44,335 INFO L443 ceAbstractionStarter]: For program point L1769(lines 1769 5185) no Hoare annotation was computed. [2019-11-15 23:36:44,335 INFO L443 ceAbstractionStarter]: For program point L2694(lines 2694 5105) no Hoare annotation was computed. [2019-11-15 23:36:44,335 INFO L443 ceAbstractionStarter]: For program point L3487(lines 3487 3498) no Hoare annotation was computed. [2019-11-15 23:36:44,336 INFO L443 ceAbstractionStarter]: For program point L3884(lines 3884 3908) no Hoare annotation was computed. [2019-11-15 23:36:44,336 INFO L443 ceAbstractionStarter]: For program point L4413(lines 4413 4952) no Hoare annotation was computed. [2019-11-15 23:36:44,336 INFO L443 ceAbstractionStarter]: For program point L4149(lines 4149 4975) no Hoare annotation was computed. [2019-11-15 23:36:44,336 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1254) no Hoare annotation was computed. [2019-11-15 23:36:44,336 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1664) no Hoare annotation was computed. [2019-11-15 23:36:44,336 INFO L443 ceAbstractionStarter]: For program point L2433(lines 2433 5127) no Hoare annotation was computed. [2019-11-15 23:36:44,336 INFO L443 ceAbstractionStarter]: For program point L2169(lines 2169 5150) no Hoare annotation was computed. [2019-11-15 23:36:44,337 INFO L443 ceAbstractionStarter]: For program point L1905(lines 1905 5173) no Hoare annotation was computed. [2019-11-15 23:36:44,337 INFO L443 ceAbstractionStarter]: For program point L2830(lines 2830 5093) no Hoare annotation was computed. [2019-11-15 23:36:44,337 INFO L443 ceAbstractionStarter]: For program point L3623(lines 3623 3634) no Hoare annotation was computed. [2019-11-15 23:36:44,337 INFO L443 ceAbstractionStarter]: For program point L4020(lines 4020 4044) no Hoare annotation was computed. [2019-11-15 23:36:44,337 INFO L443 ceAbstractionStarter]: For program point L4549(lines 4549 4940) no Hoare annotation was computed. [2019-11-15 23:36:44,337 INFO L443 ceAbstractionStarter]: For program point L4285(lines 4285 4963) no Hoare annotation was computed. [2019-11-15 23:36:44,338 INFO L443 ceAbstractionStarter]: For program point L1379(lines 1379 1390) no Hoare annotation was computed. [2019-11-15 23:36:44,338 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:36:44,338 INFO L443 ceAbstractionStarter]: For program point L1776(lines 1776 1800) no Hoare annotation was computed. [2019-11-15 23:36:44,338 INFO L443 ceAbstractionStarter]: For program point L4683(lines 4683 4929) no Hoare annotation was computed. [2019-11-15 23:36:44,338 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 4790) no Hoare annotation was computed. [2019-11-15 23:36:44,338 INFO L443 ceAbstractionStarter]: For program point L2569(lines 2569 5115) no Hoare annotation was computed. [2019-11-15 23:36:44,339 INFO L443 ceAbstractionStarter]: For program point L2305(lines 2305 5138) no Hoare annotation was computed. [2019-11-15 23:36:44,339 INFO L443 ceAbstractionStarter]: For program point L2041(lines 2041 5161) no Hoare annotation was computed. [2019-11-15 23:36:44,339 INFO L443 ceAbstractionStarter]: For program point L2966(lines 2966 5081) no Hoare annotation was computed. [2019-11-15 23:36:44,339 INFO L443 ceAbstractionStarter]: For program point L3759(lines 3759 3770) no Hoare annotation was computed. [2019-11-15 23:36:44,339 INFO L443 ceAbstractionStarter]: For program point L4816(lines 4816 4824) no Hoare annotation was computed. [2019-11-15 23:36:44,339 INFO L443 ceAbstractionStarter]: For program point L4156(lines 4156 4180) no Hoare annotation was computed. [2019-11-15 23:36:44,339 INFO L443 ceAbstractionStarter]: For program point L4685(line 4685) no Hoare annotation was computed. [2019-11-15 23:36:44,340 INFO L443 ceAbstractionStarter]: For program point L4421(lines 4421 4951) no Hoare annotation was computed. [2019-11-15 23:36:44,340 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4673) no Hoare annotation was computed. [2019-11-15 23:36:44,340 INFO L443 ceAbstractionStarter]: For program point L4818(line 4818) no Hoare annotation was computed. [2019-11-15 23:36:44,340 INFO L443 ceAbstractionStarter]: For program point L722(lines 722 5279) no Hoare annotation was computed. [2019-11-15 23:36:44,340 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1526) no Hoare annotation was computed. [2019-11-15 23:36:44,340 INFO L443 ceAbstractionStarter]: For program point L1912(lines 1912 1936) no Hoare annotation was computed. [2019-11-15 23:36:44,341 INFO L443 ceAbstractionStarter]: For program point L2705(lines 2705 5103) no Hoare annotation was computed. [2019-11-15 23:36:44,341 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 4861) no Hoare annotation was computed. [2019-11-15 23:36:44,341 INFO L443 ceAbstractionStarter]: For program point L2441(lines 2441 5126) no Hoare annotation was computed. [2019-11-15 23:36:44,341 INFO L443 ceAbstractionStarter]: For program point L2177(lines 2177 5149) no Hoare annotation was computed. [2019-11-15 23:36:44,341 INFO L443 ceAbstractionStarter]: For program point L63(lines 63 5287) no Hoare annotation was computed. [2019-11-15 23:36:44,341 INFO L443 ceAbstractionStarter]: For program point L3102(lines 3102 5069) no Hoare annotation was computed. [2019-11-15 23:36:44,344 INFO L443 ceAbstractionStarter]: For program point L3895(lines 3895 3906) no Hoare annotation was computed. [2019-11-15 23:36:44,344 INFO L439 ceAbstractionStarter]: At program point L592(lines 259 594) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-11-15 23:36:44,344 INFO L443 ceAbstractionStarter]: For program point L4292(lines 4292 4316) no Hoare annotation was computed. [2019-11-15 23:36:44,344 INFO L443 ceAbstractionStarter]: For program point L4557(lines 4557 4939) no Hoare annotation was computed. [2019-11-15 23:36:44,345 INFO L443 ceAbstractionStarter]: For program point L858(lines 858 5267) no Hoare annotation was computed. [2019-11-15 23:36:44,345 INFO L443 ceAbstractionStarter]: For program point L1651(lines 1651 1662) no Hoare annotation was computed. [2019-11-15 23:36:44,345 INFO L439 ceAbstractionStarter]: At program point L330(lines 263 553) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-11-15 23:36:44,345 INFO L443 ceAbstractionStarter]: For program point L2048(lines 2048 2072) no Hoare annotation was computed. [2019-11-15 23:36:44,345 INFO L443 ceAbstractionStarter]: For program point L2841(lines 2841 5091) no Hoare annotation was computed. [2019-11-15 23:36:44,345 INFO L443 ceAbstractionStarter]: For program point L2577(lines 2577 5114) no Hoare annotation was computed. [2019-11-15 23:36:44,346 INFO L443 ceAbstractionStarter]: For program point L2313(lines 2313 5137) no Hoare annotation was computed. [2019-11-15 23:36:44,346 INFO L443 ceAbstractionStarter]: For program point L3238(lines 3238 5057) no Hoare annotation was computed. [2019-11-15 23:36:44,346 INFO L443 ceAbstractionStarter]: For program point L4031(lines 4031 4042) no Hoare annotation was computed. [2019-11-15 23:36:44,346 INFO L443 ceAbstractionStarter]: For program point L4692(lines 4692 4928) no Hoare annotation was computed. [2019-11-15 23:36:44,346 INFO L443 ceAbstractionStarter]: For program point L4428(lines 4428 4452) no Hoare annotation was computed. [2019-11-15 23:36:44,346 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 4900) no Hoare annotation was computed. [2019-11-15 23:36:44,347 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 598) no Hoare annotation was computed. [2019-11-15 23:36:44,347 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 5255) no Hoare annotation was computed. [2019-11-15 23:36:44,347 INFO L443 ceAbstractionStarter]: For program point L1787(lines 1787 1798) no Hoare annotation was computed. [2019-11-15 23:36:44,347 INFO L439 ceAbstractionStarter]: At program point L4694(lines 26 5288) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-11-15 23:36:44,347 INFO L443 ceAbstractionStarter]: For program point L2184(lines 2184 2208) no Hoare annotation was computed. [2019-11-15 23:36:44,347 INFO L443 ceAbstractionStarter]: For program point L70(lines 70 644) no Hoare annotation was computed. [2019-11-15 23:36:44,347 INFO L443 ceAbstractionStarter]: For program point L2977(lines 2977 5079) no Hoare annotation was computed. [2019-11-15 23:36:44,348 INFO L443 ceAbstractionStarter]: For program point L2713(lines 2713 5102) no Hoare annotation was computed. [2019-11-15 23:36:44,348 INFO L443 ceAbstractionStarter]: For program point L2449(lines 2449 5125) no Hoare annotation was computed. [2019-11-15 23:36:44,348 INFO L443 ceAbstractionStarter]: For program point L3374(lines 3374 5045) no Hoare annotation was computed. [2019-11-15 23:36:44,348 INFO L443 ceAbstractionStarter]: For program point L4167(lines 4167 4178) no Hoare annotation was computed. [2019-11-15 23:36:44,348 INFO L443 ceAbstractionStarter]: For program point L4564(lines 4564 4588) no Hoare annotation was computed. [2019-11-15 23:36:44,348 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 5277) no Hoare annotation was computed. [2019-11-15 23:36:44,349 INFO L443 ceAbstractionStarter]: For program point L1130(lines 1130 5243) no Hoare annotation was computed. [2019-11-15 23:36:44,349 INFO L443 ceAbstractionStarter]: For program point L1923(lines 1923 1934) no Hoare annotation was computed. [2019-11-15 23:36:44,349 INFO L439 ceAbstractionStarter]: At program point L470(lines 403 506) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-11-15 23:36:44,349 INFO L443 ceAbstractionStarter]: For program point L2320(lines 2320 2344) no Hoare annotation was computed. [2019-11-15 23:36:44,349 INFO L443 ceAbstractionStarter]: For program point L3113(lines 3113 5067) no Hoare annotation was computed. [2019-11-15 23:36:44,349 INFO L443 ceAbstractionStarter]: For program point L2849(lines 2849 5090) no Hoare annotation was computed. [2019-11-15 23:36:44,349 INFO L443 ceAbstractionStarter]: For program point L2585(lines 2585 5113) no Hoare annotation was computed. [2019-11-15 23:36:44,350 INFO L443 ceAbstractionStarter]: For program point L3510(lines 3510 5033) no Hoare annotation was computed. [2019-11-15 23:36:44,350 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 551) no Hoare annotation was computed. [2019-11-15 23:36:44,350 INFO L443 ceAbstractionStarter]: For program point L4303(lines 4303 4314) no Hoare annotation was computed. [2019-11-15 23:36:44,350 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4709) no Hoare annotation was computed. [2019-11-15 23:36:44,350 INFO L443 ceAbstractionStarter]: For program point L4700(lines 4700 4927) no Hoare annotation was computed. [2019-11-15 23:36:44,350 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 5265) no Hoare annotation was computed. [2019-11-15 23:36:44,351 INFO L443 ceAbstractionStarter]: For program point L1266(lines 1266 5231) no Hoare annotation was computed. [2019-11-15 23:36:44,351 INFO L443 ceAbstractionStarter]: For program point L2059(lines 2059 2070) no Hoare annotation was computed. [2019-11-15 23:36:44,351 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 639) no Hoare annotation was computed. [2019-11-15 23:36:44,351 INFO L443 ceAbstractionStarter]: For program point L2456(lines 2456 2480) no Hoare annotation was computed. [2019-11-15 23:36:44,351 INFO L443 ceAbstractionStarter]: For program point L3249(lines 3249 5055) no Hoare annotation was computed. [2019-11-15 23:36:44,351 INFO L443 ceAbstractionStarter]: For program point L2985(lines 2985 5078) no Hoare annotation was computed. [2019-11-15 23:36:44,352 INFO L443 ceAbstractionStarter]: For program point L2721(lines 2721 5101) no Hoare annotation was computed. [2019-11-15 23:36:44,352 INFO L443 ceAbstractionStarter]: For program point L3646(lines 3646 5021) no Hoare annotation was computed. [2019-11-15 23:36:44,352 INFO L443 ceAbstractionStarter]: For program point L4439(lines 4439 4450) no Hoare annotation was computed. [2019-11-15 23:36:44,352 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 596) no Hoare annotation was computed. [2019-11-15 23:36:44,352 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 5253) no Hoare annotation was computed. [2019-11-15 23:36:44,352 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 4778) no Hoare annotation was computed. [2019-11-15 23:36:44,352 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 5276) no Hoare annotation was computed. [2019-11-15 23:36:44,353 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 5219) no Hoare annotation was computed. [2019-11-15 23:36:44,353 INFO L443 ceAbstractionStarter]: For program point L2195(lines 2195 2206) no Hoare annotation was computed. [2019-11-15 23:36:44,353 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 642) no Hoare annotation was computed. [2019-11-15 23:36:44,353 INFO L443 ceAbstractionStarter]: For program point L2592(lines 2592 2616) no Hoare annotation was computed. [2019-11-15 23:36:44,353 INFO L443 ceAbstractionStarter]: For program point L3385(lines 3385 5043) no Hoare annotation was computed. [2019-11-15 23:36:44,353 INFO L443 ceAbstractionStarter]: For program point L3121(lines 3121 5066) no Hoare annotation was computed. [2019-11-15 23:36:44,354 INFO L443 ceAbstractionStarter]: For program point L2857(lines 2857 5089) no Hoare annotation was computed. [2019-11-15 23:36:44,354 INFO L443 ceAbstractionStarter]: For program point L3782(lines 3782 5009) no Hoare annotation was computed. [2019-11-15 23:36:44,354 INFO L443 ceAbstractionStarter]: For program point L4707(lines 4707 4919) no Hoare annotation was computed. [2019-11-15 23:36:44,354 INFO L443 ceAbstractionStarter]: For program point L4575(lines 4575 4586) no Hoare annotation was computed. [2019-11-15 23:36:44,354 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 504) no Hoare annotation was computed. [2019-11-15 23:36:44,354 INFO L443 ceAbstractionStarter]: For program point L1141(lines 1141 5241) no Hoare annotation was computed. [2019-11-15 23:36:44,354 INFO L443 ceAbstractionStarter]: For program point L877(lines 877 5264) no Hoare annotation was computed. [2019-11-15 23:36:44,355 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 633) no Hoare annotation was computed. [2019-11-15 23:36:44,355 INFO L443 ceAbstractionStarter]: For program point L4709(line 4709) no Hoare annotation was computed. [2019-11-15 23:36:44,355 INFO L443 ceAbstractionStarter]: For program point L1538(lines 1538 5207) no Hoare annotation was computed. [2019-11-15 23:36:44,355 INFO L443 ceAbstractionStarter]: For program point L2331(lines 2331 2342) no Hoare annotation was computed. [2019-11-15 23:36:44,355 INFO L443 ceAbstractionStarter]: For program point L2728(lines 2728 2752) no Hoare annotation was computed. [2019-11-15 23:36:44,355 INFO L443 ceAbstractionStarter]: For program point L3521(lines 3521 5031) no Hoare annotation was computed. [2019-11-15 23:36:44,355 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 549) no Hoare annotation was computed. [2019-11-15 23:36:44,356 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:36:44,356 INFO L443 ceAbstractionStarter]: For program point L3257(lines 3257 5054) no Hoare annotation was computed. [2019-11-15 23:36:44,356 INFO L443 ceAbstractionStarter]: For program point L2993(lines 2993 5077) no Hoare annotation was computed. [2019-11-15 23:36:44,356 INFO L443 ceAbstractionStarter]: For program point L3918(lines 3918 4997) no Hoare annotation was computed. [2019-11-15 23:36:44,356 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 5229) no Hoare annotation was computed. [2019-11-15 23:36:44,356 INFO L443 ceAbstractionStarter]: For program point L1013(lines 1013 5252) no Hoare annotation was computed. [2019-11-15 23:36:44,357 INFO L443 ceAbstractionStarter]: For program point L749(lines 749 5275) no Hoare annotation was computed. [2019-11-15 23:36:44,357 INFO L443 ceAbstractionStarter]: For program point L1674(lines 1674 5195) no Hoare annotation was computed. [2019-11-15 23:36:44,357 INFO L443 ceAbstractionStarter]: For program point L2467(lines 2467 2478) no Hoare annotation was computed. [2019-11-15 23:36:44,357 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 641) no Hoare annotation was computed. [2019-11-15 23:36:44,357 INFO L443 ceAbstractionStarter]: For program point L2864(lines 2864 2888) no Hoare annotation was computed. [2019-11-15 23:36:44,357 INFO L443 ceAbstractionStarter]: For program point L3657(lines 3657 5019) no Hoare annotation was computed. [2019-11-15 23:36:44,357 INFO L443 ceAbstractionStarter]: For program point L3393(lines 3393 5042) no Hoare annotation was computed. [2019-11-15 23:36:44,358 INFO L443 ceAbstractionStarter]: For program point L3129(lines 3129 5065) no Hoare annotation was computed. [2019-11-15 23:36:44,358 INFO L443 ceAbstractionStarter]: For program point L4054(lines 4054 4985) no Hoare annotation was computed. [2019-11-15 23:36:44,358 INFO L443 ceAbstractionStarter]: For program point L4847(lines 4847 4871) no Hoare annotation was computed. [2019-11-15 23:36:44,358 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 5217) no Hoare annotation was computed. [2019-11-15 23:36:44,358 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 5240) no Hoare annotation was computed. [2019-11-15 23:36:44,358 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 5263) no Hoare annotation was computed. [2019-11-15 23:36:44,358 INFO L443 ceAbstractionStarter]: For program point L1810(lines 1810 5183) no Hoare annotation was computed. [2019-11-15 23:36:44,359 INFO L443 ceAbstractionStarter]: For program point L4849(line 4849) no Hoare annotation was computed. [2019-11-15 23:36:44,359 INFO L443 ceAbstractionStarter]: For program point L2603(lines 2603 2614) no Hoare annotation was computed. [2019-11-15 23:36:44,359 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 595) no Hoare annotation was computed. [2019-11-15 23:36:44,359 INFO L443 ceAbstractionStarter]: For program point L3000(lines 3000 3024) no Hoare annotation was computed. [2019-11-15 23:36:44,359 INFO L443 ceAbstractionStarter]: For program point L3793(lines 3793 5007) no Hoare annotation was computed. [2019-11-15 23:36:44,359 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 502) no Hoare annotation was computed. [2019-11-15 23:36:44,360 INFO L443 ceAbstractionStarter]: For program point L3529(lines 3529 5030) no Hoare annotation was computed. [2019-11-15 23:36:44,360 INFO L443 ceAbstractionStarter]: For program point L3265(lines 3265 5053) no Hoare annotation was computed. [2019-11-15 23:36:44,360 INFO L443 ceAbstractionStarter]: For program point L4190(lines 4190 4973) no Hoare annotation was computed. [2019-11-15 23:36:44,360 INFO L443 ceAbstractionStarter]: For program point L4719(lines 4719 4917) no Hoare annotation was computed. [2019-11-15 23:36:44,360 INFO L443 ceAbstractionStarter]: For program point L756(lines 756 780) no Hoare annotation was computed. [2019-11-15 23:36:44,360 INFO L443 ceAbstractionStarter]: For program point L624(lines 624 631) no Hoare annotation was computed. [2019-11-15 23:36:44,360 INFO L443 ceAbstractionStarter]: For program point L1549(lines 1549 5205) no Hoare annotation was computed. [2019-11-15 23:36:44,361 INFO L443 ceAbstractionStarter]: For program point L1285(lines 1285 5228) no Hoare annotation was computed. [2019-11-15 23:36:44,361 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 116) no Hoare annotation was computed. [2019-11-15 23:36:44,361 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 5251) no Hoare annotation was computed. [2019-11-15 23:36:44,361 INFO L443 ceAbstractionStarter]: For program point L1946(lines 1946 5171) no Hoare annotation was computed. [2019-11-15 23:36:44,361 INFO L443 ceAbstractionStarter]: For program point L2739(lines 2739 2750) no Hoare annotation was computed. [2019-11-15 23:36:44,361 INFO L443 ceAbstractionStarter]: For program point L4721(line 4721) no Hoare annotation was computed. [2019-11-15 23:36:44,362 INFO L443 ceAbstractionStarter]: For program point L3136(lines 3136 3160) no Hoare annotation was computed. [2019-11-15 23:36:44,362 INFO L443 ceAbstractionStarter]: For program point L3929(lines 3929 4995) no Hoare annotation was computed. [2019-11-15 23:36:44,362 INFO L443 ceAbstractionStarter]: For program point L3665(lines 3665 5018) no Hoare annotation was computed. [2019-11-15 23:36:44,362 INFO L443 ceAbstractionStarter]: For program point L3401(lines 3401 5041) no Hoare annotation was computed. [2019-11-15 23:36:44,362 INFO L443 ceAbstractionStarter]: For program point L4326(lines 4326 4961) no Hoare annotation was computed. [2019-11-15 23:36:44,362 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-11-15 23:36:44,362 INFO L443 ceAbstractionStarter]: For program point L892(lines 892 916) no Hoare annotation was computed. [2019-11-15 23:36:44,363 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 5193) no Hoare annotation was computed. [2019-11-15 23:36:44,363 INFO L443 ceAbstractionStarter]: For program point L1421(lines 1421 5216) no Hoare annotation was computed. [2019-11-15 23:36:44,363 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 252) no Hoare annotation was computed. [2019-11-15 23:36:44,363 INFO L443 ceAbstractionStarter]: For program point L1157(lines 1157 5239) no Hoare annotation was computed. [2019-11-15 23:36:44,363 INFO L443 ceAbstractionStarter]: For program point L2082(lines 2082 5159) no Hoare annotation was computed. [2019-11-15 23:36:44,363 INFO L443 ceAbstractionStarter]: For program point L2875(lines 2875 2886) no Hoare annotation was computed. [2019-11-15 23:36:44,364 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 4849) no Hoare annotation was computed. [2019-11-15 23:36:44,364 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 548) no Hoare annotation was computed. [2019-11-15 23:36:44,364 INFO L443 ceAbstractionStarter]: For program point L3272(lines 3272 3296) no Hoare annotation was computed. [2019-11-15 23:36:44,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:36:44 BoogieIcfgContainer [2019-11-15 23:36:44,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:36:44,404 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:36:44,404 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:36:44,405 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:36:44,405 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:08" (3/4) ... [2019-11-15 23:36:44,409 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:36:44,465 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 23:36:44,471 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:36:44,879 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2c13cb6b-044f-4c89-b22f-944d7d3f1e8b/bin/uautomizer/witness.graphml [2019-11-15 23:36:44,880 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:36:44,881 INFO L168 Benchmark]: Toolchain (without parser) took 40693.10 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 945.9 MB in the beginning and 833.9 MB in the end (delta: 112.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 23:36:44,882 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:36:44,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1260.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:36:44,883 INFO L168 Benchmark]: Boogie Procedure Inliner took 165.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:36:44,884 INFO L168 Benchmark]: Boogie Preprocessor took 104.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:36:44,884 INFO L168 Benchmark]: RCFGBuilder took 2604.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.9 MB). Peak memory consumption was 270.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:36:44,884 INFO L168 Benchmark]: TraceAbstraction took 36078.54 ms. Allocated memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: 869.8 MB). Free memory was 1.2 GB in the beginning and 916.6 MB in the end (delta: 256.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-15 23:36:44,885 INFO L168 Benchmark]: Witness Printer took 475.63 ms. Allocated memory is still 2.2 GB. Free memory was 916.6 MB in the beginning and 833.9 MB in the end (delta: 82.6 MB). Peak memory consumption was 82.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:36:44,887 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1260.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 165.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 104.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2604.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.9 MB). Peak memory consumption was 270.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36078.54 ms. Allocated memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: 869.8 MB). Free memory was 1.2 GB in the beginning and 916.6 MB in the end (delta: 256.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 475.63 ms. Allocated memory is still 2.2 GB. Free memory was 916.6 MB in the beginning and 833.9 MB in the end (delta: 82.6 MB). Peak memory consumption was 82.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4685]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4818]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4709]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4673]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 36]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4750]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4738]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4900]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4861]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4888]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4721]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4849]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4778]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4806]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4790]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4725]: Loop Invariant Derived loop invariant: ((((main__t <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && 61 <= main__t) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 4660]: Loop Invariant Derived loop invariant: main__t < main__tagbuf_len && 59 <= main__t - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 4765]: Loop Invariant Derived loop invariant: ((((!(__VERIFIER_assert__cond == 0) && 61 <= main__t) && !(__VERIFIER_assert__cond == 0)) && main__t < main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 475 locations, 16 error locations. Result: SAFE, OverallTime: 35.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 1545 SDtfs, 37388 SDslu, 1485 SDs, 0 SdLazy, 10813 SolverSat, 10281 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1440 GetRequests, 350 SyntacticMatches, 609 SemanticMatches, 481 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 16.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=475occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 114 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 18 NumberOfFragments, 84 HoareAnnotationTreeSize, 13 FomulaSimplifications, 11750 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 7997 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 19.0s InterpolantComputationTime, 3540 NumberOfCodeBlocks, 3540 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3524 ConstructedInterpolants, 0 QuantifiedInterpolants, 2375275 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 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...